Imagen de Portada

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Peng, Cheng, Wei, Minghan, Isler, Volkan
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
por: O'Hara, Patrick, et al.
Publicado: (2024)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
por: Casteigts, Arnaud, et al.
Publicado: (2020)

Effective Traveling for Metric Instances of the Traveling Thief Problem
por: Eube, Jan, et al.
Publicado: (2026)

The Canadian Traveller Problem on outerplanar graphs
por: Beaudou, Laurent, et al.
Publicado: (2024)

The APX-hardness of the Traveling Tournament Problem
por: Zhao, Jingyang, et al.
Publicado: (2023)

A faster heuristic for the Traveling Salesman Problem with Drone
por: Hokama, Pedro H. D. B., et al.
Publicado: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
por: Böhm, Martin, et al.
Publicado: (2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

Neighborhood-Aware Graph Labeling Problem
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
por: Clementino, Thailsson, et al.
Publicado: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
por: Saller, Sophia, et al.
Publicado: (2023)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
por: Brubach, Brian, et al.
Publicado: (2020)

Optimal Neighborhood Exploration for Dynamic Independent Sets
por: Borowitz, Jannick, et al.
Publicado: (2024)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
por: Zhao, Jingyang, et al.
Publicado: (2025)

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
por: Rohwedder, Lars, et al.
Publicado: (2024)

Assigning Agents to Increase Network-Based Neighborhood Diversity
por: Qiu, Zirou, et al.
Publicado: (2023)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
por: Philip, Allen George, et al.
Publicado: (2023)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
por: Jiang, Yonggang, et al.
Publicado: (2025)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
por: Soulignac, Francisco J.
Publicado: (2025)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
por: Ma, Xinran, et al.
Publicado: (2025)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
por: Blauth, Jannis, et al.
Publicado: (2022)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
por: Zhao, Jingyang, et al.
Publicado: (2025)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
por: Erlebach, Thomas, et al.
Publicado: (2026)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
por: Dai, Han, et al.
Publicado: (2025)

Canadian Traveller Problems in Temporal Graphs
por: Bellitto, Thomas, et al.
Publicado: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
por: Wang, Long, et al.
Publicado: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
por: Ghaseminia, Benyamin, et al.
Publicado: (2025)

Knapsack on Graphs with Relaxed Neighborhood Constraints
por: Dey, Palash, et al.
Publicado: (2025)

Stochastic Embedding of Digraphs into DAGs
por: Filtser, Arnold
Publicado: (2025)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
por: Glover, Charles N.
Publicado: (2024)

Scheduling on a Stochastic Number of Machines
por: Buchem, Moritz, et al.
Publicado: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

Testing Distributions of Huge Objects
por: Goldreich, Oded, et al.
Publicado: (2022)

First Order Stochastic Optimization with Oblivious Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Identifying Approximate Minimizers under Stochastic Uncertainty
por: Al-Thani, Hessa, et al.
Publicado: (2025)