The assignment and loading transportation problem
Authors:
- Gabriel HomsiGHGabriel Homsi
- Jeremy JordanJJJeremy Jordan
- Silvano MartelloSMSilvano Martello
- Michele MonaciMMMichele Monaci
- 1 March 2021
- journal article
- conference paper
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (3) , 999-1007
Abstract
No abstract availableKeywords
Funding Information
- Air Force Office of Scientific Research
This publication has 13 references indexed in Scilit:
- OR applied to humanitarian operationsEuropean Journal of Operational Research, 2018
- Humanitarian transportation planning: Evaluation of practice-based heuristics and recommendations for improvementEuropean Journal of Operational Research, 2018
- Average Longest Path and Maximum Cost Network Flows with Multiple-Criteria WeightsElectronic Notes in Discrete Mathematics, 2018
- Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing systemEuropean Journal of Operational Research, 2018
- Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment ProblemEuropean Journal of Operational Research, 2016
- A binary multiple knapsack model for single machine scheduling with machine unavailabilityComputers & Operations Research, 2016
- Upper and lower bounding procedures for the multiple knapsack assignment problemEuropean Journal of Operational Research, 2014
- Optimization of transportation requirements in the deployment of military unitsComputers & Operations Research, 2007
- LP based heuristics for the multiple knapsack problem with assignment restrictionsAnnals of Operations Research, 2006
- Approximation Algorithms for the Multiple Knapsack Problem with Assignment RestrictionsJournal of Combinatorial Optimization, 2000