Imagen de Portada

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lozano, Leonardo, Bergman, David, Cire, Andre A.
Formato:	Preprint
Publicado:	2022
Materias:	Optimization and Control Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
por: Hof, Hugo A., et al.
Publicado: (2025)

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

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

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
por: Boros, Endre, et al.
Publicado: (2024)

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

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

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

The Mixed Integer Trust Region Problem
por: Del Pia, Alberto
Publicado: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
por: Wu, Fei, et al.
Publicado: (2024)

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

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

Asymptotic Bounds for the Traveling Salesman Problem with Drone
por: Lee, Jae Hyeok, et al.
Publicado: (2026)

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

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

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

Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
por: Lozano, Leonardo, et al.
Publicado: (2024)

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

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

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

Assortment Optimization For Conference Goodies With Indifferent Attendees
por: Gutiérrez, Fernanda, et al.
Publicado: (2024)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
por: Thomas, Helen, et al.
Publicado: (2025)

A Knowledge Compilation Take on Binary Polynomial Optimization
por: Capelli, Florent, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

A review of minimum cost box searching games
por: Lidbetter, Thomas
Publicado: (2025)

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

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

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