A novel reformulation for the single-sink fixed charge transportation problem
Year of publication: |
February 2022
|
---|---|
Authors: | Legault, Robin ; Côté, Jean-François ; Gendron, Bernard |
Publisher: |
Montréal (Québec) : Bureau de Montreal, Université de Montreal |
Subject: | Integer programming | fixed-charge transportation problem | Lagrangian relaxation | Knapsack problem | Ganzzahlige Optimierung | Transportproblem | Transportation problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics |
-
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio, (2015)
-
Fixed-charge transportation problems on trees
Angulo, Gustavo, (2017)
-
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Liu, Fang, (2017)
- More ...
-
Parada, Lucas, (2024)
-
The disaggregated integer L-shaped method for the stochastic vehicle routing problem
Parada, Lucas, (2023)
-
A branch-and-price algorithm for the Multiple Knapsack Problem
Lalonde, Olivier, (2021)
- More ...