Polyhedral analysis for concentrator location problems
type: Item
instance of: scholarly article
title: Polyhedral analysis for concentrator location problems
zbMATH Open document ID: 1154.90529
author: Martine Labbé
author: Hande Yaman
published in: Computational Optimization and Applications
publication date: 2006-11-17T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/23773
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5073602
describes a project that uses: ABACUS
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W1963904068
cites work: Capacitated Facility Location: Valid Inequalities and Facets
cites work: Capacitated facility location: Separation algorithms and computational experience
cites work: On the \(p\)-median polytope
cites work: Facets of the knapsack polytope
cites work: Nonlinear 0–1 programming: I. Linearization techniques
cites work: Solving the Hub location problem in telecommunication network design: A local search approach
cites work: Q4198056
cites work: Q3147665
cites work: Facet of regular 0–1 polytopes
cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: Valid inequalities and facets of the capacitated plant location problem
cites work: Q3993418
cites work: Q4040221
cites work: On the facial structure of set packing polyhedra
cites work: Faces for a linear inequality in 0–1 variables
cites work: Concentrator location in telecommunications networks.
DOI: 10.1007/S10589-005-3913-Y
description: scientific article; zbMATH DE number 5073602