Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lozano, Leonardo, Bergman, David, Cire, Andre A.
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

The Mixed Integer Trust Region Problem
by: Del Pia, Alberto
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

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

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

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