Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms. For these problems, column generation is used to compute good dual bounds that can be incorporate...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2018
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/274b8c7f786a41458abd92fca2fb2cfe |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sea el primero en dejar un comentario!