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

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

Jia Guo, Daniel Solow, Nedialko B. Dimitrov, 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

optimizationheuristicsemergency managementmultiple knapsack assignment problemvehicle routing and transportation problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ The assignment and loading transportation problem

Uses Software

• OpenSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Reliable facility location design under disruptions
• Upper and lower bounding procedures for the multiple knapsack assignment problem
• The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
• Reliable Facility Location Design Under the Risk of Disruptions
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• A facility reliability problem: Formulation, properties, and algorithm
• OpenSolver - An Open Source Add-in to Solve Linear and Integer Progammes in Excel

This page was built for publication: Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem