Pages that link to "Item:Q5433190"

The following pages link to Solving the hub location problem in a star–star network (Q5433190):

Displaying 29 items.

• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
• Exact solution of hub network design problems with profits (Q1754057) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry (Q1993617) (← links)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• A combined average-case and worst-case analysis for an integrated hub location and revenue management problem (Q2296583) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← 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)
• A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)