Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. We assume good feasible solutions are already known and we focus on an efficient algorithm for proving the optimality of the solutions. The restric...
Guardado en:
Autores principales: | , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/9fd39dea92a84415a7c7eafe5f8d9019 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|