Shortest paths with exclusive-disjunction arc pairs conflicts
From MaRDI portal
Publication:6164356
DOI10.1016/j.cor.2023.106158OpenAlexW4317568881MaRDI QIDQ6164356
Carmine Sorgente, Raffaele Cerulli, Francesca Guerriero, Edoardo Scalzo
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106158
Cites Work
- Unnamed Item
- Integer programming formulations for the elementary shortest path problem
- On the path avoiding forbidden pairs polytope
- The constrained shortest path tour problem
- Colorful paths in vertex coloring of graphs
- On the complexity of paths avoiding forbidden pairs
- On finding the strongly connected components in a directed graph
- Renormalization group analysis of the small-world network model
- A two-level metaheuristic for the all colors shortest path problem
- Impossible pair constrained test path generation in a program
- Shortest path tour problem with time windows
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Solving the shortest path tour problem
- Complexity of the path avoiding forbidden pairs problem revisited
- An improved linearization strategy for zero-one quadratic programming problems
- Compact linearization for binary quadratic problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An efficient exact approach for the constrained shortest path tour problem
- A reduction heuristic for the all-colors shortest path problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Shortest paths avoiding forbidden subpaths
- Collective dynamics of ‘small-world’ networks
- Algorithms – ESA 2005
- Depth-First Search and Linear Graph Algorithms
- Tropical paths in vertex-colored graphs
This page was built for publication: Shortest paths with exclusive-disjunction arc pairs conflicts
