Equivalent instances of the simple plant location problem
From MaRDI portal
Publication:971550
DOI10.1016/j.camwa.2008.10.081zbMath1186.90067MaRDI QIDQ971550
Boris I. Goldengorin, Bader F. AlBdaiwi, Gerard Sierksma
Publication date: 16 May 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/3143837/00A54.pdf
equivalence; polytopes; simple plant location problem; pseudo-Boolean function; polynomially solvable special cases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extensions of set partitions
- Solving the simple plant location problem using a data correcting approach
- Perspectives of Monge properties in optimization
- Tolerance-based branch and bound algorithms for the ATSP
- The Plant Location Problem: New Models and Research Prospects
- Specially Structured Uncapacitated Facility Location Problems
- The Data-Correcting Algorithm for the Minimization of Supermodular Functions
- Data Correcting Algorithms in Combinatorial Optimization
- Graph-Theoretic Concepts in Computer Science