Semidefinite relaxations for partitioning, assignment and ordering problems
From MaRDI portal
Publication:5917881
DOI10.1007/s10288-012-0210-3zbMath1262.90150MaRDI QIDQ5917881
No author found.
Publication date: 18 February 2013
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-012-0210-3
Related Items
A guide to conic optimisation and its applications, Semidefinite relaxations for partitioning, assignment and ordering problems, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, Surveys in operations research, A two-level graph partitioning problem arising in mobile wireless communications, Projection results for the \(k\)-partition problem, A MAX-CUT formulation of 0/1 programs, An exact approach for the multi-constraint graph partitioning problem, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Twelve surveys in operations research
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations of ordering problems
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum graph partitioning problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Semidefinite representation of convex sets
- Bounds for the quadratic assignment problem using the bundle method
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The hypermetric cone is polyhedral
- Laplacian eigenvalues and the maximum cut problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Semidefinite programming
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- The cut polytope and the Boolean quadric polytope
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- 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
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Exact Algorithms for the Quadratic Linear Ordering Problem
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Facets of the Bipartite Subgraph Polytope
- Cones of Matrices and Set-Functions and 0–1 Optimization
- An Efficient Heuristic Procedure for Partitioning Graphs
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- On the cut polytope
- Semidefinite Programming
- Fixing Variables in Semidefinite Relaxations
- An SDP approach to multi-level crossing minimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
