Deux problèmes d'affectation non linéaires
From MaRDI portal
Publication:3953578
DOI10.1051/ro/1982160302631zbMath0491.90082OpenAlexW2587409337MaRDI QIDQ3953578
M. Beghin-Picavet, Pierre Hansen
Publication date: 1982
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104813
algorithmNP-completenessquadratic assignment problemoptimal solutioncomputational experienceoptimal assignmentassignment of rooms to departmentscubic assignment problemminimization of travel distance
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Dynamic programming (90C39)
Related Items
An ant algorithm for the single row layout problem in flexible manufacturing systems, A genetic approach to the quadratic assignment problem, 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 heuristic procedure for the single-row facility layout problem, The single row facility layout problem: state of the art, Methods for the one-dimensional space allocation problem, An efficient genetic algorithm for single row facility layout, Recent models and techniques for solving the layout problem, Single row facility layout problem using a permutation-based genetic algorithm, An efficient tabu algorithm for the single row facility layout problem, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Efficient models for the facility layout problem
