A semidefinite approach for the single row facility layout problem

DOI10.1007/978-3-031-08623-6_8MaRDI QIDQ6606626zbMATH OpenFDO

Authors Jan Schwiddessen

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_8

zbMATH Keywords

semidefinite optimizationsingle row facility layout

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Semidefinite programming (90C22)

Recommendations

• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Provably near-optimal solutions for very large single-row facility layout problems
• A computational study and survey of methods for the single-row facility layout problem
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• The single row facility layout problem: state of the art

Cites work

• .878-approximation algorithms for MAX CUT and MAX 2SAT
• 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 study of triplet formulation for single row facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
• Geometry of cuts and metrics
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
• Semidefinite relaxations of ordering problems

Cited in

(1)

• A matheuristic for solving the single row facility layout problem

This page was built for publication: A semidefinite approach for the single row facility layout problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606626)