Network design for time-constrained delivery using subgraphs

DOI10.1007/s10287-012-0154-2zbMath1282.90033OpenAlexW2029261049MaRDI QIDQ395697

Hui Chen, Ann Melissa Campbell, Barrett W. Thomas

Publication date: 30 January 2014

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-012-0154-2

zbMATH Keywords

heuristicslogisticstime definite

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06)

Related Items (1)

A bi-objective incomplete hub location-routing problem with flow shipment scheduling

Cites Work

• Unnamed Item
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• Minimax flow tree problems
• On the sum of all distances in a graph or digraph
• The complexity of designing a network with minimum diameter
• The complexity of the network design problem
• Light graphs with small routing cost
• Network design for time‐constrained delivery

This page was built for publication: Network design for time-constrained delivery using subgraphs