A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area
From MaRDI portal
Publication:2204219
zbMath1452.90209MaRDI QIDQ2204219
Kamran Azimi, Maghsud Solimanpur
Publication date: 15 October 2020
Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)
branch-and-boundmixed integer programmingmathematical programminglocation selectionfacilities planningmachine sequencinglayout designcontinuous layoutmachine selectionNMIPnonlinear MIP
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
This page was built for publication: A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area