A semidefinite approach for the single row facility layout problem

DOI10.1007/978-3-031-08623-6_8zbMATH Open1547.9011MaRDI QIDQ6606626

Jan Schwiddessen

Publication date: 17 September 2024

zbMATH Keywords

semidefinite optimizationsingle row facility layout

Mathematics Subject Classification ID

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

Cites Work

• A computational study and survey of methods for the single-row facility layout problem
• 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
• A polyhedral study of triplet formulation for single row facility layout problem
• A new lower bound for the single row facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• .878-approximation algorithms for MAX CUT and MAX 2SAT
• BiqCrunch
• Geometry of cuts and metrics

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)