Global approaches for facility layout and VLSI floorplanning
From MaRDI portal
Publication:2802548
DOI10.1007/978-1-4614-0769-0_29zbMATH Open1334.90096OpenAlexW15184458MaRDI QIDQ2802548FDOQ2802548
Authors: Miguel F. Anjos, F. Liers 
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
Recommendations
- Facility layout. Mathematical optimization techniques and engineering
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Provably near-optimal solutions for very large single-row facility layout problems
- Optimal facility layout design
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
Semidefinite programming (90C22) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- A spectral bundle method with bounds
- The quadratic assignment problem. Theory and algorithms
- Assignment Problems and the Location of Economic Activities
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Geometry of cuts and metrics
- On the cut polytope
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Optimal facility layout design
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- 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
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Semidefinite relaxations of ordering problems
- Enhanced Model Formulations for Optimal Facility Layout
- On the One-Dimensional Space Allocation Problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- A polyhedral study of triplet formulation for single row facility layout problem
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- A heuristic procedure for the single-row facility layout problem
- A new mathematical-programming framework for facility-layout design
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Facets of the linear ordering polytope
- The cut polytope and the Boolean quadric polytope
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Exact algorithms for the quadratic linear ordering problem
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Finite-State Processes and Dynamic Programming
- An r-Dimensional Quadratic Placement Algorithm
- Optimal linear arrangements using betweenness variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating lower bounds for the linear arrangement problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A spring-embedding approach for the facility layout problem
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
Cited In (16)
- QPLIB: a library of quadratic programming instances
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Decorous combinatorial lower bounds for row layout problems
- Title not available (Why is that?)
- New exact approaches to row layout problems
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Fast local search for single row facility layout
- Single row layout models
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- Improved exact approaches for row layout problems with departments of equal length
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- The corridor allocation problem
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
Uses Software
This page was built for publication: Global approaches for facility layout and VLSI floorplanning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802548)
