Abstract
With emphasis on the simple plant location problem, (SPLP), we consider an important family of discrete, deterministic, single-criterion, NP-hard, and widely applicable optimization problems. The introductory discussion on problem formulation aspects is followed by the establishment of relationships between SPLP and set packing, set covering and set partitioning problems which all are among those structures in integer programming having the most wide-spread applications. An extensive discourse on solution properties and computational techniques, spanning from early heuristics to the presumably most novel exact methods is then provided. Other subjects of concern include a subfamily of SPLP's solvable in polynomial time, analyses of approximate algorithms, transformability of p-CENTER and p-MEDIAN to SPLP, and structural properties of the SPLP polytope. Along the way we attempt to synthesize these findings and relate them to other areas of integer programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
