Pages that link to "Item:Q2776481"

The following pages link to Hub location problems in urban traffic networks (Q2776481):

Displaying 39 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques (Q342143) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making (Q1723340) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• Stochastic single-allocation hub location (Q2029287) (← links)
• The hub location and pricing problem (Q2140288) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• P-hub approach for the optimal park-and-ride facility location problem (Q2253566) (← links)
• Location of speed-up subnetworks (Q2259045) (← links)
• Modeling congestion and service time in hub location problems (Q2295119) (← links)
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels (Q2835680) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Hub Arc Location Problems: Part I—Introduction and Results (Q3115931) (← links)
• A Transportation Network Model as a Tool to Solve Urban Planning Location Problems (Q4408518) (← links)
• A co-opetitive framework for the hub location problems in transportation networks (Q4598854) (← links)
• Mathematical modeling of a bi-objective hub location-routing problem for rapid transit networks (Q5053908) (← links)
• Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
• A Benders Decomposition for Hub Location Problems Arising in Public Transport (Q5391891) (← links)
• Upgrading arcs to minimize the maximum travel time in a network (Q5469125) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
• A parallel adaptive memory algorithm for the capacitated modular hub location problem (Q6164373) (← links)
• An alternative approach to address uncertainty in hub location (Q6176182) (← links)