A compact quadratic model and linearizations for the minimum linear arrangement problem
From MaRDI portal
Publication:2091791
Recommendations
- Minimum linear arrangements
- Contributions to the minimum linear arrangement problem.
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- On a binary distance model for the minimum linear arrangement problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
Cites work
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- Contributions to the minimum linear arrangement problem.
- Decorous lower bounds for minimum linear arrangement
- Experiments on the minimum linear arrangement problem
- Laying out sparse graphs with provably minimum bandwidth
- Minimum linear arrangements
- Optimal linear arrangements using betweenness variables
Cited in
(9)- New relationships for multi-neighborhood search for the minimum linear arrangement problem
- Minimum linear arrangements
- Contributions to the minimum linear arrangement problem.
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- On a binary distance model for the minimum linear arrangement problem
- Linear models and computational experiments for the quadratic TSP
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- An improved approximation ratio for the minimum linear arrangement problem
This page was built for publication: A compact quadratic model and linearizations for the minimum linear arrangement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091791)