Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
From MaRDI portal
Publication:2901038
DOI10.1287/ijoc.1080.0270zbMath1243.90174OpenAlexW2105318109MaRDI QIDQ2901038
Miguel F. Anjos, Anthony Vannelli
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0270
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Queues and service in operations research (90B22) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (37)
Strong mixed-integer formulations for the floor layout problem ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization ⋮ 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 ⋮ 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 ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ The corridor allocation problem ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ 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 ⋮ Generalized Benders' decomposition for topology optimization problems ⋮ An efficient genetic algorithm for single row facility layout ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility 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 ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Semidefinite Programming and Constraint Programming ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
Uses Software
This page was built for publication: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
