Image de couverture de livre

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Villa, Tullio, Vercesi, Eleonora, Barta, Janos, Mastrolilli, Monaldo
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
par: Vercesi, Eleonora, et autres
Publié: (2025)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
par: Bernardelli, Ambrogio Maria, et autres
Publié: (2024)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
par: Lee, Jae Hyeok, et autres
Publié: (2026)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
par: Encz, Koppány István, et autres
Publié: (2025)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
par: Li, Zongji, et autres
Publié: (2023)

On a Traveling Salesman Problem for Points in the Unit Cube
par: Balogh, József, et autres
Publié: (2023)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

The Mixed Integer Trust Region Problem
par: Del Pia, Alberto
Publié: (2024)

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

Minimum Cut Representability of Stable Matching Problems
par: Faenza, Yuri, et autres
Publié: (2025)

Minimum 0-Extension Problems on Directed Metrics
par: Hirai, Hiroshi, et autres
Publié: (2020)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
par: Hu, Hins, et autres
Publié: (2025)

Branch and Price for the Length-Constrained Cycle Partition Problem
par: Ghannam, Mohammed, et autres
Publié: (2024)

A Tight Formulation for the Dial-a-Ride Problem
par: Gaul, Daniela, et autres
Publié: (2023)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
par: Alidaee, Bahram, et autres
Publié: (2024)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
par: Lozano, Leonardo, et autres
Publié: (2022)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
par: Tellache, Nour ElHouda, et autres
Publié: (2025)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
par: Baeckelant, Timothy, et autres
Publié: (2026)

An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem
par: Pacheco-Valencia, Víctor, et autres
Publié: (2024)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
par: Bussemaker, Jasper H., et autres
Publié: (2025)

A Bi-criterion Steiner Traveling Salesperson Problem with Time Windows for Last-Mile Electric Vehicle Logistics
par: Agarwal, Prateek, et autres
Publié: (2024)

Hybrid Metaheuristic Vehicle Routing Problem for Security Dispatch Operations
par: Vu, Nguyen Gia Hien, et autres
Publié: (2025)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
par: Marić, Nevena
Publié: (2025)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
par: Diaby, Moustapha
Publié: (2016)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
par: Moldenhauer, Carsten, et autres
Publié: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
par: Wang, Changjun, et autres
Publié: (2026)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
par: Jabbari-Marand, Behnam, et autres
Publié: (2026)

Shortest Paths in Graphs of Convex Sets
par: Marcucci, Tobia, et autres
Publié: (2021)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)

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

On Supportedness in Multi-Objective Combinatorial Optimization
par: Könen, David, et autres
Publié: (2025)

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

An exact approach for the multi-depot electric vehicle scheduling problem
par: Haslinger, Xenia, et autres
Publié: (2025)

Factorized binary polynomial optimization
par: Del Pia, Alberto
Publié: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
par: Del Pia, Alberto, et autres
Publié: (2022)