Equivalent instances of the simple plant location problem

DOI10.1016/J.CAMWA.2008.10.081MaRDI QIDQ971550zbMATH OpenOpenAlexFDO

Authors Gerard Sierksma, Bader F. AlBdaiwi, Boris Goldengorin

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

equivalencepolytopespseudo-Boolean functionpolynomially solvable special casessimple plant location problem

Mathematics Subject Classification ID

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

Recommendations

• New variants of the simple plant location problem and applications
• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• scientific article; zbMATH DE number 634020
• The capacitated plant location problem
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
• New valid inequalities and facets for the simple plant location problem
• scientific article; zbMATH DE number 2032354
• An aggressive reduction scheme for the simple plant location problem

Cites work

• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 1310285 (Why is no real title available?)
• scientific article; zbMATH DE number 3244974 (Why is no real title available?)
• scientific article; zbMATH DE number 3378707 (Why is no real title available?)
• Data Correcting Algorithms in Combinatorial Optimization
• Extensions of set partitions
• Graph-Theoretic Concepts in Computer Science
• Perspectives of Monge properties in optimization
• Solving the simple plant location problem using a data correcting approach
• Specially Structured Uncapacitated Facility Location Problems
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions
• The Plant Location Problem: New Models and Research Prospects
• Tolerance-based branch and bound algorithms for the ATSP

Cited in

(2)

• Data aggregation for \(p\)-median problems
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971550)