Global approaches for facility layout and VLSI floorplanning
From MaRDI portal
(Redirected from Publication:2802548)
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
Cites work
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A heuristic procedure for the single-row facility layout problem
- A new heuristic for the linear placement problem
- A new lower bound for the single row facility layout problem
- A new mathematical-programming framework for facility-layout design
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- A note on xQx as a modelling and solution framework for the linear ordering problem
- A polyhedral study of triplet formulation for single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A Spectral Bundle Method for Semidefinite Programming
- A spectral bundle method with bounds
- A spring-embedding approach for the facility layout problem
- An r-Dimensional Quadratic Placement Algorithm
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Applying the sequence-pair representation to optimal facility layout designs
- Assignment Problems and the Location of Economic Activities
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- CSDP, A C library for semidefinite programming
- Efficient models for the facility layout problem
- Enhanced Model Formulations for Optimal Facility Layout
- Exact algorithms for the quadratic linear ordering problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Facets of the linear ordering polytope
- Finite-State Processes and Dynamic Programming
- Generating lower bounds for the linear arrangement problem
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 1187154 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Methods for the one-dimensional space allocation problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the cut polytope
- On the exact solution of a facility layout problem
- On the One-Dimensional Space Allocation Problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimal facility layout design
- Optimal linear arrangements using betweenness variables
- Provably near-optimal solutions for very large single-row facility layout problems
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- Semidefinite relaxations of ordering problems
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- The cut polytope and the Boolean quadric polytope
- The quadratic assignment problem. Theory and algorithms
Cited in
(16)- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- Improved exact approaches for row layout problems with departments of equal length
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Decorous combinatorial lower bounds for row layout problems
- 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
- 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
- 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
- scientific article; zbMATH DE number 54185 (Why is no real title available?)
- Construction heuristics for the single row layout problem with machine-spanning clearances
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)
