Pages that link to "Item:Q1771311"

The following pages link to A branch and cut algorithm for hub location problems with single assignment (Q1771311):

Displaying 41 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)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
• Polyhedral analysis for concentrator location problems (Q853560) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• A ring-mesh topology design problem for optical transport networks (Q1009188) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← 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)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
• Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
• A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels (Q2835680) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Solving the Hub location problem in telecommunication network design: A local search approach (Q3156824) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)
• A survivable variant of the ring star problem (Q6196876) (← links)