The strong network orientation problem

DOI10.1111/ITOR.13229MaRDI QIDQ6082268zbMATH OpenFDO

Authors Christophe Duhamel, Andréa Cynthia Santos

Publication date 29 November 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13229

zbMATH Keywords

heuristicsmixed integer linear programmingnetwork designstrong connectivityurban network

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
• A meta-heuristic approach for solving the urban network design problem
• A review of urban transportation network design problems
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Directing Road Networks by Listing Strong Orientations
• Distances in orientations of graphs
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
• Finding strong bridges and strong articulation points in linear time
• Graph orientations with set connectivity requirements
• Heuristics for urban road network design: lane layout and signal settings
• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
• Improving post-disaster road network accessibility by strengthening links against failures
• Introduction to algorithms.
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
• Model and methods to address urban road network problems with disruptions
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
• Road network emergency accessibility planning after a major earthquake
• Scheduling and routing algorithms for AGVs: A survey
• Selecting an Optimum Configuration of One-Way and Two-Way Routes
• Strongly connected orientations of mixed multigraphs
• Survey of research in the design and control of automated guided vehicle systems
• TTT plots: a perl program to create time-to-target plots
• Variable neighborhood search
• Work-troop scheduling for road network accessibility after a major earthquake

Cited in

(2)

• Design of survivable networks with low connectivity requirements
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6082268)