Copertina

Asymptotic Bounds for the Traveling Salesman Problem with Drone

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lee, Jae Hyeok, Hwang, Taekang, Kwon, Changhyun
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
di: Villa, Tullio, et al.
Pubblicazione: (2025)

The Mixed Integer Trust Region Problem
di: Del Pia, Alberto
Pubblicazione: (2024)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
di: Baeckelant, Timothy, et al.
Pubblicazione: (2026)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
di: Costandin, Marius, et al.
Pubblicazione: (2023)

Minimum Cut Representability of Stable Matching Problems
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

Minimum 0-Extension Problems on Directed Metrics
di: Hirai, Hiroshi, et al.
Pubblicazione: (2020)

An SDP Relaxation for the Sparse Integer Least Squares Problem
di: Del Pia, Alberto, et al.
Pubblicazione: (2022)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
di: Hu, Hins, et al.
Pubblicazione: (2025)

Branch and Price for the Length-Constrained Cycle Partition Problem
di: Ghannam, Mohammed, et al.
Pubblicazione: (2024)

A Tight Formulation for the Dial-a-Ride Problem
di: Gaul, Daniela, et al.
Pubblicazione: (2023)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
di: Li, Zongji, et al.
Pubblicazione: (2023)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
di: Bernardelli, Ambrogio Maria, et al.
Pubblicazione: (2024)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
di: Lozano, Leonardo, et al.
Pubblicazione: (2022)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

On Circuit Diameter Bounds via Circuit Imbalances
di: Dadush, Daniel, et al.
Pubblicazione: (2021)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
di: Bussemaker, Jasper H., et al.
Pubblicazione: (2025)

A Bi-criterion Steiner Traveling Salesperson Problem with Time Windows for Last-Mile Electric Vehicle Logistics
di: Agarwal, Prateek, et al.
Pubblicazione: (2024)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
di: Fujiwara, Hiroshi, et al.
Pubblicazione: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
di: Proença, Nathan Benedetto, et al.
Pubblicazione: (2026)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
di: Wang, Changjun, et al.
Pubblicazione: (2026)

On the Virtual Network Embedding polytope
di: Benhamiche, Amal, et al.
Pubblicazione: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
di: Jabbari-Marand, Behnam, et al.
Pubblicazione: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
di: Lucci, Mauro, et al.
Pubblicazione: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
di: Bangerter, Elise, et al.
Pubblicazione: (2026)

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
di: Kang, Wonwoo, et al.
Pubblicazione: (2024)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
di: Alidaee, Bahram, et al.
Pubblicazione: (2024)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
di: Moldenhauer, Carsten, et al.
Pubblicazione: (2025)

Geoffrion's theorem beyond finiteness and rationality
di: Dey, Santanu S., et al.
Pubblicazione: (2025)

Shortest Paths in Graphs of Convex Sets
di: Marcucci, Tobia, et al.
Pubblicazione: (2021)

Order acceptance and scheduling in capacitated job shops
di: Linß, Florian, et al.
Pubblicazione: (2024)

A review of minimum cost box searching games
di: Lidbetter, Thomas
Pubblicazione: (2025)

Market proliferation and the impact of locational complexity on network restructuring
di: Pinar-Pérez, J. M., et al.
Pubblicazione: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
di: Könen, David, et al.
Pubblicazione: (2025)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
di: Swamy, Rahul, et al.
Pubblicazione: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
di: Del Pia, Alberto
Pubblicazione: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
di: Haslinger, Xenia, et al.
Pubblicazione: (2025)

Factorized binary polynomial optimization
di: Del Pia, Alberto
Pubblicazione: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
di: Del Pia, Alberto, et al.
Pubblicazione: (2022)

Projection-width as a structural parameter for discrete separable optimization
di: Del Pia, Alberto
Pubblicazione: (2025)