Decorous Lower Bounds for Minimum Linear Arrangement
From MaRDI portal
Publication:2899100
DOI10.1287/ijoc.1100.0390zbMath1243.90185OpenAlexW2172284060WikidataQ57702178 ScholiaQ57702178MaRDI QIDQ2899100
Alberto Caprara, Juan-José Salazar-González, Adam N. Letchford
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45449/1/10.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Improved exact approaches for row layout problems with departments of equal length, Branch and bound for the cutwidth minimization problem, Semidefinite relaxations of ordering problems, On a class of metrics related to graph layout problems, A polyhedral approach to the single row facility layout problem, Exact solution of the 2-dimensional grid arrangement problem, Decorous combinatorial lower bounds for row layout problems, On a binary distance model for the minimum linear arrangement problem, Optimization Bounds from the Branching Dual, Lower and upper bounds for the linear arrangement problem on interval graphs, Optimal linear arrangements using betweenness variables, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Discrete Optimization with Decision Diagrams, A note on computational approaches for the antibandwidth problem, A compact quadratic model and linearizations for the minimum linear arrangement problem
