Semidefinite relaxations of ordering problems (Q359627)

From MaRDI portal

Revision as of 00:23, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Semidefinite relaxations of ordering problems	scientific article

Statements

scholarly article

0 references

Semidefinite relaxations of ordering problems (English)

0 references

Philipp Hungerländer

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

12 August 2013

0 references

zbMATH Keywords

quadratic ordering problem

0 references

semidefinite optimization

0 references

describes a project that uses

0 references

0 references

Harwell-Boeing sparse matrix collection

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-012-0627-7

0 references

A new lower bound for the single row facility layout problem

0 references

A polyhedral approach to the single row facility layout problem

0 references

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

0 references

Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes

0 references

Provably near-optimal solutions for very large single-row facility layout problems

0 references

0 references

Exact Algorithms for the Quadratic Linear Ordering Problem

0 references

Optimal linear arrangements using betweenness variables

0 references

Decorous Lower Bounds for Minimum Linear Arrangement

0 references

An SDP Approach to Multi-level Crossing Minimization

0 references

0 references

Fixing Variables in Semidefinite Relaxations

0 references

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

0 references

Some simplified NP-complete graph problems

0 references

Optimal Weighted Ancestry Relationships

0 references

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

0 references

A Cutting Plane Algorithm for the Linear Ordering Problem

0 references

Optimal Assignments of Numbers to Vertices

0 references

0 references

A spectral approach to bandwidth and separator problems in graphs

0 references

An Interior-Point Method for Semidefinite Programming

0 references

0 references

A computational study and survey of methods for the single-row facility layout problem

0 references

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

0 references

Optimal linear labelings and eigenvalues of graphs

0 references

A branch and bound algorithm for the acyclic subgraph problem

0 references

0 references

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

0 references

Heuristics and meta-heuristics for 2-layer straight line crossing minimization

0 references

0 references

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

0 references

The cut polytope and the Boolean quadric polytope

0 references

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

0 references

One-Dimensional Space Allocation: An Ordering Algorithm

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10107-012-0627-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:359627

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q359627&oldid=38076762"