Polyhedral analysis for concentrator location problems

DOI10.1007/s10589-005-3913-yzbMath1154.90529OpenAlexW1963904068MaRDI QIDQ853560

Martine Labbé, Hande Yaman

Publication date: 17 November 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23773

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (3)

General network design: a unified view of combined location and network design problems ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems

Uses Software

• ABACUS
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Valid inequalities and facets of the capacitated plant location problem
• Capacitated facility location: Separation algorithms and computational experience
• Concentrator location in telecommunications networks.
• A branch and cut algorithm for hub location problems with single assignment
• Solving the Hub location problem in telecommunication network design: A local search approach
• Nonlinear 0–1 programming: I. Linearization techniques
• 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

This page was built for publication: Polyhedral analysis for concentrator location problems