A branch and cut algorithm for hub location problems with single assignment
From MaRDI portal
Publication:1771311
DOI10.1007/S10107-004-0531-XzbMath1079.90080OpenAlexW2070737799MaRDI QIDQ1771311
Eric Gourdin, Martine Labbé, Hande Yaman
Publication date: 19 April 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/24095
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (43)
Solving the Hub location problem in telecommunication network design: A local search approach ⋮ Survivability in hierarchical telecommunications networks ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Polyhedral analysis for concentrator location problems ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ General network design: a unified view of combined location and network design problems ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ A survivable variant of the ring star problem ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems ⋮ Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming ⋮ The capacitated single-allocation hub location problem revisited: a note on a classical formulation ⋮ Perspectives on modeling hub location problems ⋮ A ring-mesh topology design problem for optical transport networks ⋮ A study of the quadratic semi-assignment polytope ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ The tree of hubs location problem ⋮ Hub Location Problems: The Location of Interacting Facilities
Uses Software
Cites Work
- Approximation algorithms for access network design
- Geometric algorithms and combinatorial optimization
- Valid inequalities and facets of the capacitated plant location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Capacitated facility location: Separation algorithms and computational experience
- Concentrator location in telecommunications networks.
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Capacitated Facility Location: Valid Inequalities and Facets
- On the facial structure of set packing polyhedra
- On the \(p\)-median polytope
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A branch and cut algorithm for hub location problems with single assignment
