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

DOI10.1016/j.disopt.2005.03.001zbMath1077.90046OpenAlexW2002576503MaRDI QIDQ2568330

Anthony Vannelli, Andrew Kennings, Miguel F. Anjos

Publication date: 10 October 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.03.001

zbMATH Keywords

Global optimizationCombinatorial optimizationFacilities planning and designSpace allocationSemidefinite optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Continuous location (90B85)

Related Items

Strong mixed-integer formulations for the floor layout problem, Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Construction heuristics for the single row layout problem with machine-spanning clearances, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices, The double row layout problem, Single row layout models, Fast local search for single row facility layout, Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem, A parallel ordering problem in facilities layout, Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm, Improved exact approaches for row layout problems with departments of equal length, Insertion based Lin-Kernighan heuristic for single row facility layout, A computational study and survey of methods for the single-row facility layout problem, Semidefinite relaxations of ordering problems, A polyhedral study of triplet formulation for single row facility layout problem, A polyhedral approach to the single row facility layout problem, Decorous combinatorial lower bounds for row layout problems, Optimal solutions for the double row layout problem, The single row facility layout problem: state of the art, An efficient genetic algorithm for single row facility layout, Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm, The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms, A GRASP algorithm for solving large-scale single row facility layout problems, A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem, A decomposition-based algorithm for the double row layout problem, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Mathematical optimization approach for facility layout on several rows, Simulated annealing and tabu search approaches for the Corridor Allocation Problem, Single row facility layout problem using a permutation-based genetic algorithm, An efficient tabu algorithm for the single row facility layout problem, Semidefinite relaxations for partitioning, assignment and ordering problems, Global Approaches for Facility Layout and VLSI Floorplanning, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, A new lower bound for the single row facility layout problem, Semidefinite relaxations for partitioning, assignment and ordering problems, New exact approaches to row layout problems, Computational enhancements in low-rank semidefinite programming

Uses Software

• SDPT3
• PENNON
• COL
• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite programming for discrete optimization and matrix completion problems
• Efficient models for the facility layout problem
• Methods for the one-dimensional space allocation problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• A heuristic procedure for the single-row facility layout problem
• A spectral bundle method with bounds
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Solving large quadratic assignment problems on computational grids
• Generating lower bounds for the linear arrangement problem
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Assignment Problems and the Location of Economic Activities
• Facets of the linear ordering polytope
• On the One-Dimensional Space Allocation Problem
• On Solving A One-Dimensional Space Allocation Problem With Integer Programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
• PENNON: A code for convex nonlinear and semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• A Spectral Bundle Method for Semidefinite Programming
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Optimal Linear Ordering
• Solving semidefinite programs using preconditioned conjugate gradients
• Finite-State Processes and Dynamic Programming
• One-Dimensional Space Allocation: An Ordering Algorithm
• Handbook of semidefinite programming. Theory, algorithms, and applications