Methods for the one-dimensional space allocation problem
From MaRDI portal
Publication:916571
DOI10.1016/0305-0548(90)90051-8zbMath0703.90075OpenAlexW2058225603MaRDI QIDQ916571
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90051-8
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
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, Insertion based Lin-Kernighan heuristic for single row facility layout, A computational study and survey of methods for the single-row facility layout problem, The single row facility layout problem: state of the art, An efficient genetic algorithm for single row facility layout, Global Approaches for Facility Layout and VLSI Floorplanning, A new lower bound for the single row facility layout problem, Formulating and solving production planning problems, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, The influence of the fitness evaluation method on the performance of multiobjective search algorithms
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Some experiments with simulated annealing for coloring graphs
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Classification by ordering a (sparse) matrix: A ``simulated annealing approach
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Some simplified NP-complete graph problems
- The Quadratic Assignment Problem
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Euclidean matching problems and the metropolis algorithm
- Some Layout Problems on the Line with Interdistance Constraints and Costs
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File
- Optimal Linear Ordering
- Equation of State Calculations by Fast Computing Machines
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
- Placement of Records on a Secondary Storage Device to Minimize Access Time
