:: Library Catalog

Imatge de la portada

Guardat en:

Dades bibliogràfiques
Autors principals:	Lee, Jae Hyeok, Hwang, Taekang, Kwon, Changhyun
Format:	Preprint
Publicat:	2026
Matèries:	Optimization and Control Discrete Mathematics
Accés en línia:	https://arxiv.org/abs/2603.00328
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars

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

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

The Mixed Integer Trust Region Problem
per: Del Pia, Alberto
Publicat: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Hybrid Metaheuristic Vehicle Routing Problem for Security Dispatch Operations
per: Vu, Nguyen Gia Hien, et al.
Publicat: (2025)

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

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

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

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

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

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

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

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

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

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

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

A review of minimum cost box searching games
per: Lidbetter, Thomas
Publicat: (2025)

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

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

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

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

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

Factorized binary polynomial optimization
per: Del Pia, Alberto
Publicat: (2024)

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