Decorous combinatorial lower bounds for row layout problems
From MaRDI portal
Recommendations
- A new exact approach to the space-free double row layout problem
- A new lower bound for the single row facility layout problem
- New exact approaches to row layout problems
- Combining simulation and optimization for extended double row facility layout problems in factory planning
- The double row layout problem
Cites work
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- A computational study and survey of methods for the single-row facility layout problem
- A decomposition-based algorithm for the double row layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- A new exact approach to the space-free double row layout problem
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- A new lower bound for the single row facility layout problem
- A parallel ordering problem in facilities layout
- A polyhedral approach to the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A semidefinite optimization-based approach for global optimization of multi-row facility layout
- A survey for the quadratic assignment problem
- An efficient tabu algorithm for the single row facility layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An improved mixed-integer programming model for the double row layout of facilities
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combining simulation and optimization for extended double row facility layout problems in factory planning
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Decorous lower bounds for minimum linear arrangement
- Directional decomposition heuristic for a linear machine-cell location problem.
- Double-row facility layout with replicate machines and split flows
- Efficient models for the facility layout problem
- Fast local search for single row facility layout
- Fast simulated annealing for single-row equidistant facility layout
- Generating lower bounds for the linear arrangement problem
- Global approaches for facility layout and VLSI floorplanning
- Hospital Layout as a Quadratic Assignment Problem
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- Improved exact approaches for row layout problems with departments of equal length
- Machine layout problem in modern manufacturing facilities
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Matroids and the greedy algorithm
- New exact approaches to row layout problems
- On the exact solution of a facility layout problem
- Optimal Assignments of Numbers to Vertices
- Optimal numberings and isoperimetric problems on graphs
- Optimal solutions for the double row layout problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Semidefinite relaxations of ordering problems
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Single row layout models
- Solution approaches for the double-row equidistant facility layout problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Spine layout design
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- The checkpoint ordering problem
- The corridor allocation problem
- The double row layout problem
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cited in
(10)- A new lower bound for the single row facility layout problem
- A decomposition-based algorithm for the double row layout problem
- Mathematical optimization approach for facility layout on several rows
- Exact approaches for the combined cell layout problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Combining simulation and optimization for extended double row facility layout problems in factory planning
- A new exact approach to the space-free double row layout problem
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- A mixed-integer programming formulation for optimizing the double row layout problem
- A fast local search based memetic algorithm for the parallel row ordering problem
This page was built for publication: Decorous combinatorial lower bounds for row layout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189888)
