Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

DOI10.1287/trsc.26.2.138zbMath0795.90036OpenAlexW1993303144MaRDI QIDQ4019566

Peter L. Hammer, P. M. Dearing, Bruno Simeone

Publication date: 16 January 1993

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.26.2.138

zbMATH Keywords

set coveringtree networksimple plant locationweighted vertex packingminimization of a pseudo-Boolean functionplant location graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Related Items

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, Complexity evaluation of benchmark instances for the \(p\)-median problem, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Berge-acyclic multilinear 0-1 optimization problems, Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA