Exact algorithms for the quadratic linear ordering problem
From MaRDI portal
Recommendations
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Semidefinite relaxations of ordering problems
- scientific article; zbMATH DE number 3902051
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
Cited in
(23)- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- The simplest families of polytopes associated with NP-hard problems
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Computational approaches to MAX-cut
- Global approaches for facility layout and VLSI floorplanning
- Crossing Minimization in Storyline Visualization
- A computational study and survey of methods for the single-row facility layout problem
- Semidefinite relaxations of ordering problems
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Strong SDP based bounds on the cutwidth of a graph
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- Quantum graph drawing (best student paper)
- Revisiting ILP models for exact crossing minimization in storyline drawings
- Efficient separation of RLT cuts for implicit and explicit bilinear terms
- Width notions for ordering-related problems
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Facet-defining triangle inequalities for the quadratic linear ordering problem
- Quantum graph drawing
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: Exact algorithms for the quadratic linear ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899047)
