A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem
Year of publication: |
April 2018
|
---|---|
Authors: | Melchiori, Anna ; Sgalambro, Antonino |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 92.2018, p. 111-129
|
Subject: | Quickest flow | k-splittable flow | Matheuristics | Flows over time | Multicommodity | Suchtheorie | Search theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
-
A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem
Melchiori, Anna, (2020)
-
A family of search directions for Karmarkar's algorithm
Anstreicher, Kurt M., (1990)
-
An orienteering model for the search and rescue problem
Guitouni, Adel, (2014)
- More ...
-
A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem
Melchiori, Anna, (2020)
-
UN World Food Programme : toward zero hunger with analytics
Peters, Koen, (2022)
-
An Agent-Based framework for modeling and solving location problems
Bruno, Giuseppe, (2010)
- More ...