Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem

DOI10.1016/j.ejor.2016.09.004zbMath1394.90386MaRDI QIDQ1751729

Nedialko B. Dimitrov, Jia Guo, Daniel Solow, Joseph G. Szmerekovsky

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.004

zbMATH Keywords

optimization; heuristics; emergency management; multiple knapsack assignment problem; vehicle routing and transportation problem

Mathematics Subject Classification ID

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B25: Reliability, availability, maintenance, inspection in operations research

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Uses Software

• OpenSolver