Polyhedral analysis for concentrator location problems

DOI10.1007/S10589-005-3913-YMaRDI QIDQ853560zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Concentrator location in telecommunications
• Concentrator location in telecommunications networks.
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• A branch and cut algorithm for hub location problems with single assignment
• Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities

Cites work

• scientific article; zbMATH DE number 1803762 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A branch and cut algorithm for hub location problems with single assignment
• Capacitated Facility Location: Valid Inequalities and Facets
• 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
• Nonlinear 0–1 programming: I. Linearization techniques
• On the \(p\)-median polytope
• On the facial structure of set packing polyhedra
• Solving the Hub location problem in telecommunication network design: A local search approach
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Valid inequalities and facets of the capacitated plant location problem

Cited in

(13)

• A new extended formulation with valid inequalities for the capacitated concentrator location problem
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• The location-dispatching problem: polyhedral results and content delivery network design
• Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
• The location-dispatching problem: polyhedral results and content delivery network design
• On the capacitated concentrator location problem: a reformulation by discretization
• Concentrator location in telecommunications networks.
• scientific article; zbMATH DE number 2065332 (Why is no real title available?)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• Polyhedral analysis and branch-and-cut for the structural analysis problem
• Solving convex location problems with gauges in polynomial time
• General network design: a unified view of combined location and network design problems
• Application of the facility location problem to the problem of locating concentrators on an FAA microwave system

Describes a project that uses

Uses Software

• ABACUS
• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853560)