Pages that link to "Item:Q833527"

The following pages link to Tight bounds from a path based formulation for the tree of hub location problem (Q833527):

Displaying 33 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)
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• Looking for edge-equitable spanning trees (Q336753) (← links)
• Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
• Tree network design avoiding congestion (Q646180) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system (Q2290577) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← 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)
• New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
• On hub location problems in geographically flexible networks (Q6071054) (← links)
• Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems (Q6146856) (← links)