Pages that link to "Item:Q1686520"

The following pages link to Exact and heuristic approaches for the cycle hub location problem (Q1686520):

Displaying 17 items.

• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
• The hub location problem with market selection (Q2027000) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
• On carriers collaboration in hub location problems (Q2286966) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
• Planning and design of intermodal hub networks: a literature review (Q2669565) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Solving the continuous multiple allocation<i>p</i>-hub median problem by the hyperbolic smoothing approach (Q3453424) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• The profit-oriented hub line location problem with elastic demand (Q6047874) (← links)
• A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584) (← links)