Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
From MaRDI portal
Publication:4540090
DOI<57::AID-NET4>3.0.CO;2-R 10.1002/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-RzbMath1002.90079OpenAlexW1967545106MaRDI QIDQ4540090
Bettina Klinz, Karin Feldbacher, Rainer E. Burkard, Gerhard J. Woeginger
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199901)33:1<57::aid-net4>3.0.co;2-r
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
A column generation approach for the strong network orientation problem ⋮ The strong network orientation problem ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Methods for solving road network problems with disruptions ⋮ Directing Road Networks by Listing Strong Orientations
Cites Work
- Distances in orientations of graphs
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
- Minimizing and maximizing the diameter in orientations of graphs
- Topology of series-parallel networks
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- The Recognition of Series Parallel Digraphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- On the Complexity of Timetable and Multicommodity Flow Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On optimal orientations of Cartesian products of even cycles and paths
- A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
