Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

This paper develops a general solution framework based on aggregation techniques to solve NP-Hard problems that can be formulated as a circulation model with specific side constraints. The size of the extended Mixed Integer Linear Programming formulation is generally pseudo-polynomial. To efficientl...

ver descrição completa

Detalhes bibliográficos
Autor principal: Clautiaux, François (author)
Outros Autores: Hanafi, Said (author), Macedo, Rita Alexandra Santos Gonçalves (author), Voge, Marie-Émilie (author), Alves, Cláudio (author)
Formato: article
Idioma:eng
Publicado em: 2017
Assuntos:
Integer programming
Arc-flow integer models
Aggregation of integer models
Combinatorial optimization
Social Sciences
Science & Technology
Texto completo:http://hdl.handle.net/1822/53060
País:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/53060

Texto Completo

http://hdl.handle.net/1822/53060

Registos relacionados