Cover Image

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Montemanni, Roberto, Smith, Derek H.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs
by: Montemanni, Roberto, et al.
Published: (2025)

On Solving the Assignment Problem with Conflicts
by: Montemanni, Roberto, et al.
Published: (2025)

On Solving the Knapsack Problem with Conflicts
by: Montemanni, Roberto, et al.
Published: (2025)

On Solving the Maximum Flow Problem with Conflict Constraints
by: Montemanni, Roberto, et al.
Published: (2025)

On Solving the Set Covering Problem with Conflicts on Sets
by: Montemanni, Roberto, et al.
Published: (2025)

Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning
by: Garcia, Raul, et al.
Published: (2023)

Stochastic Shortest Path Problem with Failure Probability
by: Otsubo, Ritsusamuel
Published: (2024)

Convergence and Robustness Bounds for Distributed Asynchronous Shortest-Path
by: Miller, Jared, et al.
Published: (2025)

Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems
by: Hansson, Anders, et al.
Published: (2026)

Discrete Shortest Paths in Optimal Power Flow Feasible Regions
by: Turizo, Daniel, et al.
Published: (2024)

Disjunctive Benders Decomposition
by: Fang, Kaiwen, et al.
Published: (2025)

A New Computational Approach for Solving Linear Bilevel Programs Based on Parameter-Free Disjunctive Decomposition
by: Mohammadi, Saeed, et al.
Published: (2022)

Multi-armed Bandit for Stochastic Shortest Path in Mixed Autonomy
by: Bai, Yu, et al.
Published: (2025)

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

Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost
by: Zhang, Qiao, et al.
Published: (2025)

Exact Hull Reformulation for Quadratically Constrained Generalized Disjunctive Programs
by: Gusev, Sergey, et al.
Published: (2025)

Partial Lagrange Multiplier Expressions and Disjunctive Decompositions for Bilevel Optimization
by: Nie, Jiawang, et al.
Published: (2023)

Solving Non-Monotone Inclusions Using Monotonicity of Pairs of Operators
by: Le, Ba Khiet, et al.
Published: (2025)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
by: Kelley, Shannon, et al.
Published: (2025)

The Shortest Temporal Exploration Problem
by: Balev, Stefan, et al.
Published: (2025)

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

An Efficient Method for Extracting the Shortest Path from the Dubins Set for Short Distances Between Initial and Final Positions
by: Huang, Xuanhao, et al.
Published: (2023)

Mixed-Integer Reaggregated Hull Reformulation of Special Structured Generalized Linear Disjunctive Programs
by: Lee, Albert Joon, et al.
Published: (2026)

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery
by: Tristán, Carolina, et al.
Published: (2024)

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

$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)

Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs
by: Ovalle, Daniel, et al.
Published: (2024)

Method for Solving State-Path Constrained Optimal Control Problems Using Adaptive Radau Collocation
by: Byczkowski, Cale A., et al.
Published: (2023)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
by: Marica, Edina, et al.
Published: (2026)

DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
by: Pal, Shraman, et al.
Published: (2026)

Solving Implicit Inverse Problems with Homotopy-Based Regularization Path
by: Parodi, Davide, et al.
Published: (2025)

Shortest-path recovery from signature with an optimal control approach
by: Rauscher, Marco, et al.
Published: (2023)

Disjunctive Sum of Squares
by: Ahmadi, Amir Ali, et al.
Published: (2026)

Aircraft Conflict Resolution: A Benchmark Generator
by: Pelegrin, Mercedes, et al.
Published: (2024)

Tiny Recursive Models for Solving the J2-Perturbed Lambert Problem
by: Wijayatunga, Minduli, et al.
Published: (2026)

Branch & Solve for Hub Location
by: Fernández, Elena, et al.
Published: (2025)

Cut-based Conflict Analysis in Mixed Integer Programming
by: Mexi, Gioni, et al.
Published: (2024)

The All-Pairs Vitality-Maximization (VIMAX) Problem
by: Paul, Alice, et al.
Published: (2023)

Learning Dominant States in Elementary Resource Constrained Shortest Path Problems
by: Basso, Saverio, et al.
Published: (2026)