Minimum linear arrangements

DOI10.1016/J.ENDM.2017.10.012zbMATH Open1383.05141OpenAlexW2766354434MaRDI QIDQ2413151FDOQ2413151

Authors: Rafael Andrade, Tibérius Bonates, Mardson da Silva Ferreira, Manoel Campêlo 

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.012

Recommendations

• A compact quadratic model and linearizations for the minimum linear arrangement problem
• Contributions to the minimum linear arrangement problem.
• A New Lower Bound for the Minimum Linear Arrangement of a Graph
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• On a binary distance model for the minimum linear arrangement problem

zbMATH Keywords

quadratic programmingmixed integer programmingcompact modelminimum linear arrangement

Mathematics Subject Classification ID

Quadratic programming (90C20) Integer programming (90C10) Signed and weighted graphs (05C22)

Cites Work

• Smallest compact formulation for the permutahedron
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

Cited In (8)

• Minimizing setups in ordered sets of fixed width
• Minimum Linear Arrangement of Series-Parallel Graphs
• An optimal time algorithm for minimum linear arrangement of chord graphs
• A New Lower Bound for the Minimum Linear Arrangement of a Graph
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Minimum Cell Connection in Line Segment Arrangements
• Contributions to the minimum linear arrangement problem.
• A compact quadratic model and linearizations for the minimum linear arrangement problem

This page was built for publication: Minimum linear arrangements

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