Polyhedral analysis for concentrator location problems
From MaRDI portal
Publication:853560
DOI10.1007/S10589-005-3913-YzbMATH Open1154.90529OpenAlexW1963904068MaRDI QIDQ853560FDOQ853560
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- On the facial structure of set packing polyhedra
- A branch and cut algorithm for hub location problems with single assignment
- 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
- Capacitated Facility Location: Valid Inequalities and Facets
- Title not available (Why is that?)
- Solving the Hub location problem in telecommunication network design: A local search approach
- On the \(p\)-median polytope
- Capacitated facility location: Separation algorithms and computational experience
- Nonlinear 0–1 programming: I. Linearization techniques
- Concentrator location in telecommunications networks.
Cited In (13)
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
- Polyhedral analysis and branch-and-cut for the structural analysis problem
- A new extended formulation with valid inequalities for the capacitated concentrator location problem
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
- General network design: a unified view of combined location and network design problems
- Concentrator location in telecommunications networks.
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Solving convex location problems with gauges in polynomial time
- The location-dispatching problem: polyhedral results and content delivery network design
- The location-dispatching problem: polyhedral results and content delivery network design
- Title not available (Why is that?)
- On the capacitated concentrator location problem: a reformulation by discretization
Uses Software
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)
