Network design for time-constrained delivery using subgraphs

DOI10.1007/S10287-012-0154-2MaRDI QIDQ395697zbMATH OpenOpenAlexFDO

Authors Ann Melissa Campbell, Barrett W. Thomas, Hui Chen

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

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

Recommendations

• Network design for time‐constrained delivery
• Network design for express shipment delivery
• The delivery man problem on a tree network
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
• scientific article; zbMATH DE number 7267210

Cites work

• Concerning the number of edges in a graph with diameter constraints
• Light graphs with small routing cost
• Minimax flow tree problems
• Network design for time‐constrained delivery
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition 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

Cited in

(2)

• Network design for time‐constrained delivery
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling

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

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