Image de couverture de livre

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Peng, Cheng, Wei, Minghan, Isler, Volkan
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
par: O'Hara, Patrick, et autres
Publié: (2024)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
par: Antoniadis, Antonios, et autres
Publié: (2020)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
par: Casteigts, Arnaud, et autres
Publié: (2020)

Effective Traveling for Metric Instances of the Traveling Thief Problem
par: Eube, Jan, et autres
Publié: (2026)

The Canadian Traveller Problem on outerplanar graphs
par: Beaudou, Laurent, et autres
Publié: (2024)

The APX-hardness of the Traveling Tournament Problem
par: Zhao, Jingyang, et autres
Publié: (2023)

A faster heuristic for the Traveling Salesman Problem with Drone
par: Hokama, Pedro H. D. B., et autres
Publié: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
par: Clementino, Thailsson, et autres
Publié: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
par: Saller, Sophia, et autres
Publié: (2023)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
par: Dughmi, Shaddin, et autres
Publié: (2025)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
par: Brubach, Brian, et autres
Publié: (2020)

Optimal Neighborhood Exploration for Dynamic Independent Sets
par: Borowitz, Jannick, et autres
Publié: (2024)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
par: Zhao, Jingyang, et autres
Publié: (2025)

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
par: Rohwedder, Lars, et autres
Publié: (2024)

Assigning Agents to Increase Network-Based Neighborhood Diversity
par: Qiu, Zirou, et autres
Publié: (2023)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
par: Philip, Allen George, et autres
Publié: (2023)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
par: Jiang, Yonggang, et autres
Publié: (2025)

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

Parameterized Complexity of Directed Traveling Salesman Problem
par: Blažej, Václav, et autres
Publié: (2025)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
par: Ma, Xinran, et autres
Publié: (2025)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
par: Blauth, Jannis, et autres
Publié: (2022)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
par: Zhao, Jingyang, et autres
Publié: (2025)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
par: Erlebach, Thomas, et autres
Publié: (2026)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

Canadian Traveller Problems in Temporal Graphs
par: Bellitto, Thomas, et autres
Publié: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
par: Ghaseminia, Benyamin, et autres
Publié: (2025)

Knapsack on Graphs with Relaxed Neighborhood Constraints
par: Dey, Palash, et autres
Publié: (2025)

Stochastic Embedding of Digraphs into DAGs
par: Filtser, Arnold
Publié: (2025)

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

Scheduling on a Stochastic Number of Machines
par: Buchem, Moritz, et autres
Publié: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
par: Caragiannis, Ioannis, et autres
Publié: (2026)

Testing Distributions of Huge Objects
par: Goldreich, Oded, et autres
Publié: (2022)

First Order Stochastic Optimization with Oblivious Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Identifying Approximate Minimizers under Stochastic Uncertainty
par: Al-Thani, Hessa, et autres
Publié: (2025)