Equivalent instances of the simple plant location problem

DOI10.1016/j.camwa.2008.10.081zbMath1186.90067OpenAlexW2097186154MaRDI QIDQ971550

Gerard Sierksma, Boris I. Goldengorin, Bader F. AlBdaiwi

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

zbMATH Keywords

equivalencepolytopessimple plant location problempseudo-Boolean functionpolynomially solvable special cases

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (1)

Data aggregation for \(p\)-median problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalent instances of the simple plant location problem