Minimum linear arrangements

DOI10.1016/J.ENDM.2017.10.012MaRDI QIDQ2413151zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

quadratic programmingmixed integer programmingcompact modelminimum linear arrangement

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

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

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)