Combining Surrogate Duality with Improving Sequences for Integer Programming
Recently a new technique for solving pure integer programming problems has been suggested It consists on building a sequence of Lagrangean duals that progressively reduces the duality gap and, in a finite number of steps, converges to the optimal value of the original problem. The technique has, how...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2019
|
| Texto completo: | http://hdl.handle.net/10362/84235 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/84235 |