The assignment and loading transportation problem

DOI10.1016/j.ejor.2019.07.039zbMath1487.90553OpenAlexW2962964363WikidataQ127494181 ScholiaQ127494181MaRDI QIDQ2029276

Michele Monaci, Jeremy Jordan, Gabriel Homsi, Silvano Martello

Publication date: 3 June 2021

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

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

zbMATH Keywords

heuristic algorithmsassignment problemloading constraintsmultiple knapsack probleminteger linear programming formulations

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ The transportation problem with packing constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A binary multiple knapsack model for single machine scheduling with machine unavailability
• Optimization of transportation requirements in the deployment of military units
• LP based heuristics for the multiple knapsack problem with assignment restrictions
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• Tug scheduling for hinterland barge transport: a branch-and-price approach
• OR applied to humanitarian operations
• Humanitarian transportation planning: evaluation of practice-based heuristics and recommendations for improvement
• Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
• An application of the multiple knapsack problem: the self-sufficient marine
• Upper and lower bounding procedures for the multiple knapsack assignment problem

This page was built for publication: The assignment and loading transportation problem