Semidefinite relaxations of ordering problems
From MaRDI portal
Publication:359627
DOI10.1007/s10107-012-0627-7zbMath1272.90046OpenAlexW2141768845MaRDI QIDQ359627
Philipp Hungerländer, Franz Rendl
Publication date: 12 August 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0627-7
Related Items
Construction heuristics for the single row layout problem with machine-spanning clearances, Single row layout models, A computational study and survey of methods for the single-row facility layout problem, Strong SDP based bounds on the cutwidth of a graph, Decorous combinatorial lower bounds for row layout problems, A semidefinite optimization approach to the target visitation problem, A linear ordering problem with weighted rank, The single row facility layout problem: state of the art, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem, 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, Block-insertion-based algorithms for the linear ordering problem, Semidefinite relaxations for partitioning, assignment and ordering problems, Using a factored dual in augmented Lagrangian methods for semidefinite programming, New exact approaches to row layout problems, Exact approaches for the combined cell layout problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A new lower bound for the single row facility layout problem
- A branch and bound algorithm for the acyclic subgraph problem
- Optimal linear labelings and eigenvalues of graphs
- Some simplified NP-complete graph problems
- Optimal linear arrangements using betweenness variables
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- The cut polytope and the Boolean quadric polytope
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Decorous Lower Bounds for Minimum Linear Arrangement
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Optimal Weighted Ancestry Relationships
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A spectral approach to bandwidth and separator problems in graphs
- An Interior-Point Method for Semidefinite Programming
- Fixing Variables in Semidefinite Relaxations
- An SDP Approach to Multi-level Crossing Minimization
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimal Assignments of Numbers to Vertices
