Pages that link to "Item:Q5503760"

The following pages link to Network design for time‐constrained delivery (Q5503760):

Displaying 13 items.

• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• A Stackelberg hub arc location model for a competitive environment (Q337007) (← links)
• Network design for time-constrained delivery using subgraphs (Q395697) (← links)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
• Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• LTL logistics networks with differentiated services (Q1761236) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
• Minimax flow tree problems (Q3057112) (← links)