Name
Title | ||
|---|---|---|
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. |
Abstract | ||
|---|---|---|
•We propose a new framework for managing pseudo-polynomial integer linear programs.•The quality of the approximations obtained is analyzed.•The method outperforms the best methods from the literature on two hard combinatorial problems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2016.09.051 | European Journal of Operational Research |
Keywords | Field | DocType |
Integer programming,Arc-flow integer models,Aggregation of integer models,Combinatorial optimization | Flow network,Vehicle routing problem,Pseudo-polynomial time,Mathematical optimization,Branch and price,Algorithm,Combinatorial optimization,Integer programming,Iterated function,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
258 | 2 | 0377-2217 |
Citations | PageRank | References |
4 | 0.38 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| François Clautiaux | 1 | 248 | 17.16 |
| Saïd Hanafi | 2 | 584 | 42.21 |
| Rita Macedo | 3 | 68 | 5.57 |
| Marie-Emilie Voge | 4 | 79 | 6.86 |
| Cláudio Alves | 5 | 184 | 16.29 |