On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts
Open Access
- 27 October 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 163-168
Abstract
No abstract availableAll Related Versions
Funding Information
- Google Cloud Research Credits Program
This publication has 42 references indexed in Scilit:
- Branch and Bound and Dynamic Programming Approaches for the Path Avoiding Forbidden Pairs Problem2021
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairsNetworks, 2020
- Parameterized Complexity of Geometric Covering Problems Having ConflictsAlgorithmica, 2019
- Parameterized Complexity of Conflict-Free Set Cover2019
- A multiethnic genetic approach for the minimum conflict weighted spanning tree problemNetworks, 2019
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approachAnnals of Operations Research, 2018
- A branch and cut algorithm for minimum spanning trees under conflict constraintsOptimization Letters, 2014
- The maximum flow problem with disjunctive constraintsJournal of Combinatorial Optimization, 2011
- Kernel Search: a new heuristic framework for portfolio selectionComputational Optimization and Applications, 2010
- A note on two problems in connexion with graphsNumerische Mathematik, 1959