Arc-dependent networks: theoretical insights and a computational study
From MaRDI portal
Publication:6588520
DOI10.1007/s10479-024-05910-zzbMATH Open1543.90296MaRDI QIDQ6588520
Matthew Williamson, Alvaro Velasquez, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimal length resolution refutations of difference constraint systems
- On the complexity of approximating the independent set problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A note on the complexity of longest path problems related to graph coloring
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Special cases of the quadratic shortest path problem
- BARON: A general purpose global optimization software package
- On the analysis of optimization problems in arc-dependent networks
- On finding shortest paths in arc-dependent networks
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On Solving the Quadratic Shortest Path Problem
- The Delivery Man Problem and Cumulative Matroids
- Time‐dependent traveling salesman problem–the deliveryman case
- On finding minimum routes in a network with turn penalties
- On the approximability of path and cycle problems in arc-dependent networks
This page was built for publication: Arc-dependent networks: theoretical insights and a computational study