A branch and cut algorithm for hub location problems with single assignment

DOI10.1007/s10107-004-0531-xzbMath1079.90080MaRDI QIDQ1771311

Martine Labbé, Hande Yaman, Eric Gourdin

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

zbMATH Keywords

Branch and cut; Hub location; Polyhedral analysis

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B80: Discrete location and assignment

Related Items

Solving the Hub location problem in telecommunication network design: A local search approach

Uses Software

• ABACUS
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Capacitated Facility Location: Valid Inequalities and Facets
• On the facial structure of set packing polyhedra
• On the \(p\)-median polytope