Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162)

scientific article; zbMATH DE number 6605536

Language	Label	Description	Also known as
English	Semidefinite relaxations for partitioning, assignment and ordering problems	scientific article; zbMATH DE number 6605536

Statements

instance of

scholarly article

0 references

title

Semidefinite relaxations for partitioning, assignment and ordering problems (English)

0 references

zbMATH Open document ID

1342.90127

0 references

DOI

10.1007/s10479-015-2015-1

0 references

published in

Annals of Operations Research

0 references

publication date

22 July 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

semidefinite optimization

0 references

partitioning problem

0 references

ordering problem

0 references

assignment problem

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-015-2015-1

0 references

0 references

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

A semidefinite optimization approach for the single-row layout problem with unequal dimensions

0 references

Q3425132

0 references

Facets of the Bipartite Subgraph Polytope

0 references

Experiments in quadratic 0-1 programming

0 references

On the cut polytope

0 references

Semidefinite relaxations for partitioning, assignment and ordering problems

0 references

Exact Algorithms for the Quadratic Linear Ordering Problem

0 references

Assignment Problems

0 references

An SDP Approach to Multi-level Crossing Minimization

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function

0 references

Laplacian eigenvalues and the maximum cut problem

0 references

The cut polytope and the Boolean quadric polytope

0 references

The hypermetric cone is polyhedral

0 references

Q3236244

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION

0 references

A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

0 references

A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

0 references

Q4526964

0 references

Fixing Variables in Semidefinite Relaxations

0 references

Semidefinite programming

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

Semidefinite representation of convex sets

0 references

Semidefinite relaxations of ordering problems

0 references

Improved approximation algorithms for maximum graph partitioning problems

0 references

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

0 references

Q4400639

0 references

Reducibility among Combinatorial Problems

0 references

Q3983251

0 references

An Efficient Heuristic Procedure for Partitioning Graphs

0 references

Q3395491

0 references

Q5292090

0 references

Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008

0 references

On the Shannon capacity of a graph

0 references

Q4407449

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Solving \(k\)-cluster problems to optimality with semidefinite programming

0 references

The linear ordering problem. Exact and heuristic methods in combinatorial optimization.

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Q4324980

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

Computational aspects of a branch and bound algorithm for quadratic zero- one programming

0 references

Semidefinite Relaxations for Integer Programming

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

Bounds for the quadratic assignment problem using the bundle method

0 references

From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems

0 references

Polyhedral and semidefinite programming methods in combinatorial optimization

0 references

Semidefinite Programming

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

Semidefinite programming relaxations for the quadratic assignment problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5925162