Polyhedral study of simple plant location problem with order

DOI10.1016/j.orl.2012.12.006zbMath1262.90079OpenAlexW2059116131MaRDI QIDQ1949680

Xenia Klimentova, Maurizio Boccia, Igor' Leonidovich Vasilyev

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)

Related Items (8)

A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem ⋮ Discrete facility location in machine learning ⋮ Dynamically second-preferred \(p\)-center problem ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ Approximation of the competitive facility location problem with MIPs ⋮ A branch and cut heuristic for a runway scheduling problem ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

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