A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- 1 June 2005
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 2 (2), 113-122
- https://doi.org/10.1016/j.disopt.2005.03.001
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- 15. A Cutting Plane Algorithm for Large Scale Semidefinite RelaxationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- Semidefinite Programming in the Space of Partial Positive Semidefinite MatricesSIAM Journal on Optimization, 2003
- A spectral bundle method with boundsMathematical Programming, 2002
- Solving large quadratic assignment problems on computational gridsMathematical Programming, 2002
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General FrameworkSIAM Journal on Optimization, 2001
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial OptimizationSIAM Journal on Optimization, 2000
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Facets of the linear ordering polytopeMathematical Programming, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973