On the Boolean-quadric packing uncapacitated facility-location polytope

DOI10.1023/A:1018972400378zbMath0911.90237OpenAlexW55928545MaRDI QIDQ1273120

Janny M. Y. Leung, Jon Lee, Jill R. Hardin

Publication date: 5 May 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018972400378

zbMATH Keywords

designtelecommunication networkscutting-plane algorithmBoolean-quadric uncapacitated packing facility-location polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, A Lagrangian relaxation approach to the edge-weighted clique problem, Volume computation for sparse Boolean quadric relaxations