Global Approaches for Facility Layout and VLSI Floorplanning
From MaRDI portal
Publication:2802548
DOI10.1007/978-1-4614-0769-0_29zbMath1334.90096OpenAlexW15184458MaRDI QIDQ2802548
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/604/2/zaik2010-604.pdf
Semidefinite programming (90C22) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (14)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ The corridor allocation problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ QPLIB: a library of quadratic programming instances ⋮ New exact approaches to row layout problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations of ordering problems
- A polyhedral study of triplet formulation for single row facility layout problem
- Efficient models for the facility layout problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- Methods for the one-dimensional space allocation problem
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A new lower bound for the single row facility layout problem
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Optimal facility layout design
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- The quadratic assignment problem. Theory and algorithms
- A heuristic procedure for the single-row facility layout problem
- A spectral bundle method with bounds
- Optimal linear arrangements using betweenness variables
- The cut polytope and the Boolean quadric polytope
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- Generating lower bounds for the linear arrangement problem
- A new heuristic for the linear placement problem
- Applying the sequence-pair representation to optimal facility layout designs
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- A New Mathematical-Programming Framework for Facility-Layout Design
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- Assignment Problems and the Location of Economic Activities
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Enhanced Model Formulations for Optimal Facility Layout
- Facets of the linear ordering polytope
- On the One-Dimensional Space Allocation Problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A spring-embedding approach for the facility layout problem
- On the cut polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An r-Dimensional Quadratic Placement Algorithm
- Geometry of cuts and metrics
This page was built for publication: Global Approaches for Facility Layout and VLSI Floorplanning
