Exact Algorithms for the Quadratic Linear Ordering Problem
From MaRDI portal
Publication:2899047
DOI10.1287/ijoc.1090.0318zbMath1243.90168OpenAlexW2146535985MaRDI QIDQ2899047
Angelika Wiegele, Lanbo Zheng, Christoph Buchheim
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/560/2/zaik2007-560.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, A computational study and survey of methods for the single-row facility layout problem, Semidefinite relaxations of ordering problems, Strong SDP based bounds on the cutwidth of a graph, Efficient separation of RLT cuts for implicit and explicit bilinear products, A rearrangement of adjacency matrix based approach for solving the crossing minimization problem, Crossing Minimization in Storyline Visualization, Quadratic Combinatorial Optimization Using Separable Underestimators, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, Semidefinite relaxations for partitioning, assignment and ordering problems, Computational Approaches to Max-Cut, Global Approaches for Facility Layout and VLSI Floorplanning, Semidefinite relaxations for partitioning, assignment and ordering problems, The simplest families of polytopes associated with NP-hard problems
Uses Software
