Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/53070
Título: | Dual-feasible functions for integer programming and combinatorial optimization: basics, extensions and applications |
Autor(es): | Alves, Cláudio Clautiaux, François Carvalho, José Valério de Rietz, Jurgen Endre |
Data: | 2016 |
Editora: | Springer International Publishing AG |
Resumo(s): | [Extrato] The concept of dual-feasible function (DFF) has been used to improve the resolution of several combinatorial optimization problems involving knapsack inequalities like cutting and packing, scheduling, and vehicle routing problems. DFF were used for the first time by Lueker (1983) to obtain lower bounds for the bin-packing problem. Since then, the main application of DFF was in the computation of lower bounds, even though other applications do exist, as, for instance, the generation of valid inequalities for integer programs (Chvátal 1973). |
Tipo: | Livro |
URI: | https://hdl.handle.net/1822/53070 |
ISBN: | 978-3-319-27602-1 |
e-ISBN: | 2364-6888 978-3-319-27604-5 |
DOI: | 10.1007/978-3-319-27604-5 |
ISSN: | 2364-687X |
Arbitragem científica: | no |
Acesso: | Acesso restrito autor |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Dual-feasible functions for ipco.pdf Acesso restrito! | 2,16 MB | Adobe PDF | Ver/Abrir |