Contributions to the minimum linear arrangement problem.

MaRDI QIDQ3086030zbMATH OpenFDO

Authors Hanna Seitz

Publication date 29 March 2011

Full work available at URL http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2010/10578/

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A compact quadratic model and linearizations for the minimum linear arrangement problem
• Minimum linear arrangements
• On a binary distance model for 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

Cited in

(19)

• New relationships for multi-neighborhood search for the minimum linear arrangement problem
• Optimal linear arrangements using betweenness variables
• A compact quadratic model and linearizations for the minimum linear arrangement problem
• Minimum linear arrangements
• The linear arrangement problem parameterized above guaranteed value
• Minimum linear arrangement of chord graphs
• Lower bounds for the minimum linear arrangement of a graph
• Decorous lower bounds for minimum linear arrangement
• The Linear Arrangement Problem Parameterized Above Guaranteed Value
• A New Lower Bound for the Minimum Linear Arrangement of a Graph
• A variation on the min cut linear arrangement problem
• On a binary distance model for the minimum linear arrangement problem
• An optimal time algorithm for minimum linear arrangement of chord graphs
• Experiments on the minimum linear arrangement problem
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Multiscale approach for the network compression-friendly ordering
• On a class of metrics related to graph layout problems
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• A new hybrid evolutionary algorithm for the MinLA problem

Describes a project that uses

Uses Software

• SoPlex
• Concorde

This page was built for publication: Contributions to the minimum linear arrangement problem.

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