Polyhedral study of simple plant location problem with order

DOI10.1016/J.ORL.2012.12.006MaRDI QIDQ1949680zbMATH OpenOpenAlexFDO

Authors Xenia Klimentova, Igor' Leonidovich Vasilyev, Maurizio Boccia

Publication date 14 May 2013

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2012.12.006

zbMATH Keywords

branch-and-cut algorithmfacet-defining inequalitysimple plant location problem with order

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A strengthened formulation for the simple plant location problem with order
• On the facets of the simple plant location packing polytope
• scientific article; zbMATH DE number 634020
• Polyhedral analysis and decompositions for capacitated plant location-type problems
• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 2032354
• New variants of the simple plant location problem and applications
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM

Cited in

(14)

• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
• Approximation of the competitive facility location problem with MIPs
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
• New valid inequalities and facets for the simple plant location problem
• -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
• A strengthened formulation for the simple plant location problem with order
• Location with preferences
• A cut generation algorithm of finding an optimal solution in a market competition
• Discrete facility location in machine learning
• A branch and cut heuristic for a runway scheduling problem
• Dynamically second-preferred p-center problem
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
• Insights into the computational complexity of the single-source capacitated facility location problem with customer preferences

This page was built for publication: Polyhedral study of simple plant location problem with order

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