Pages that link to "Item:Q4019566"
From MaRDI portal
The following pages link to Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem (Q4019566):
Displaying 6 items.
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA (Q3057146) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
