The strong network orientation problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Work-troop scheduling for road network accessibility after a major earthquake
Road network emergency accessibility planning after a major earthquake
Graph orientations with set connectivity requirements
Finding strong bridges and strong articulation points in linear time
Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
A meta-heuristic approach for solving the urban network design problem
Distances in orientations of graphs
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
Variable neighborhood search
Improving post-disaster road network accessibility by strengthening links against failures
A review of urban transportation network design problems
Heuristics for urban road network design: lane layout and signal settings
TTT plots: a perl program to create time-to-target plots
Survey of research in the design and control of automated guided vehicle systems
Directing Road Networks by Listing Strong Orientations
Strongly connected orientations of mixed multigraphs
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
Selecting an Optimum Configuration of One-Way and Two-Way Routes
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Scheduling and routing algorithms for AGVs: A survey
Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
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
Model and methods to address urban road network problems with disruptions

This page was built for publication: The strong network orientation problem