Optimal capacitated ring trees
We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees. The objective is the minimization of edge costs but could also incorp...
Guardado en:
Autores principales: | Alessandro Hill, Stefan Voß |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2016
|
Materias: | |
Acceso en línea: | https://doaj.org/article/e8442715fd204038b9c8ac4b8d93152f |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013) -
A polyhedral approach to the generalized minimum labeling spanning tree problem
por: ThiagoGouveiada Silva, et al.
Publicado: (2019) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017)