Semidefinite relaxations of ordering problems
From MaRDI portal
Recommendations
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3850790 (Why is no real title available?)
- scientific article; zbMATH DE number 1187154 (Why is no real title available?)
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- scientific article; zbMATH DE number 1500684 (Why is no real title available?)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A branch and bound algorithm for the acyclic subgraph problem
- A computational study and survey of methods for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A spectral approach to bandwidth and separator problems in graphs
- An Interior-Point Method for Semidefinite Programming
- An SDP approach to multi-level crossing minimization
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Decorous lower bounds for minimum linear arrangement
- Exact algorithms for the quadratic linear ordering problem
- Fixing Variables in Semidefinite Relaxations
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimal Assignments of Numbers to Vertices
- Optimal Weighted Ancestry Relationships
- Optimal linear arrangements using betweenness variables
- Optimal linear labelings and eigenvalues of graphs
- Provably near-optimal solutions for very large single-row facility layout problems
- Some simplified NP-complete graph problems
- The cut polytope and the Boolean quadric polytope
Cited in
(28)- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Strong SDP based bounds on the cutwidth of a graph
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Exact algorithms for the quadratic linear ordering problem
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- A linear ordering problem with weighted rank
- Computational approaches to MAX-cut
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- A semidefinite approach for the single row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- On discrete optimization with ordering
- The single row facility layout problem: state of the art
- New exact approaches to row layout problems
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Decorous combinatorial lower bounds for row layout problems
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Single row layout models
- Block-insertion-based algorithms for the linear ordering problem
- A semidefinite optimization approach to the target visitation problem
- Iterated local search with ejection chains for the space-free multi-row facility layout problem
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- Exact approaches for the combined cell layout problem
- Global approaches for facility layout and VLSI floorplanning
- scientific article; zbMATH DE number 1757965 (Why is no real title available?)
- A computational study and survey of methods for the single-row facility layout problem
This page was built for publication: Semidefinite relaxations of ordering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359627)
