Pages that link to "Item:Q319742"

The following pages link to Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742):

Displaying 15 items.

• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Exact solution of hub network design problems with profits (Q1754057) (← links)
• A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network (Q1793287) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• On carriers collaboration in hub location problems (Q2286966) (← 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)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)