The assignment and loading transportation problem
Year of publication: |
2021
|
---|---|
Authors: | Homsi, Gabriel ; Jordan, Jeremy ; Martello, Silvano ; Monaci, Michele |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 3 (16.3.), p. 999-1007
|
Subject: | Mutiple knapsack problem | Assignment problem | Loading constraints | Integer linear programming formulations | Heuristic algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Transportproblem | Transportation problem | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Algorithmic approaches to the multiple knapsack assignment problem
Martello, Silvano, (2019)
-
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Liu, Fang, (2017)
-
A GRASP algorithm for the container stowage slot planning problem
Parreño, Francisco, (2016)
- More ...
-
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Lodi, Andrea, (2011)
-
Lower bounds and heuristic algorithms for the k i -partitioning problem
Dell’Amico, Mauro, (2006)
-
Two-dimensional packing problems: A survey
Lodi, Andrea, (2002)
- More ...