Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
From MaRDI portal
Recommendations
Cited in
(11)- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- On a connection between facility location and perfect graphs
- Polyhedral study of simple plant location problem with order
- Berge-acyclic multilinear 0-1 optimization problems
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
- scientific article; zbMATH DE number 634020 (Why is no real title available?)
- scientific article; zbMATH DE number 1107784 (Why is no real title available?)
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Equivalent instances of the simple plant location problem
This page was built for publication: Boolean and Graph Theoretic Formulations 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 Q4019566)