Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Berinski, Hernán | - |
| dc.creator | Zabala, Paula Lorena | - |
| dc.date | 2019-01-23T17:56:48Z | - |
| dc.date | 2019-01-23T17:56:48Z | - |
| dc.date | 2011-08 | - |
| dc.date | 2019-01-17T13:58:28Z | - |
| dc.date.accessioned | 2019-04-29T15:32:37Z | - |
| dc.date.available | 2019-04-29T15:32:37Z | - |
| dc.date.issued | 2019-01-23T17:56:48Z | - |
| dc.date.issued | 2019-01-23T17:56:48Z | - |
| dc.date.issued | 2011-08 | - |
| dc.date.issued | 2019-01-17T13:58:28Z | - |
| dc.identifier | Berinski, Hernán; Zabala, Paula Lorena; An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem; Elsevier; Electronic Notes in Discrete Mathematics; 37; C; 8-2011; 273-278 | - |
| dc.identifier | 1571-0653 | - |
| dc.identifier | http://hdl.handle.net/11336/68447 | - |
| dc.identifier | CONICET Digital | - |
| dc.identifier | CONICET | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/296145 | - |
| dc.description | We study the capacitated m-ring-star problem (CmRSP) that faces the design of minimum cost network structure that connects customers with m rings using a set of ring connections that share a distinguished node (depot), and optionally star connections that connect customers to ring nodes. Ring and star connections have some associated costs. Also, rings can include transit nodes, named Steiner nodes, to reduce the total network cost if possible. The number of customers in each ring-star (ring's customers and customer connected to it through star connections) have an upper bound (capacity).These kind of networks are appropriate in optical fiber urban environments. CmRSP is know to be NP-Hard. In this paper we propose an integer linear programming formulation and a branch-and-cut algorithm. | - |
| dc.description | Fil: Berinski, Hernán. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | - |
| dc.description | Fil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Elsevier | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.endm.2011.05.047 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065311000485 | - |
| dc.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.rights | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | - |
| dc.source | reponame:CONICET Digital (CONICET) | - |
| dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
| dc.source | instacron:CONICET | - |
| dc.subject | BRANCH-AND-CUT | - |
| dc.subject | INTEGER PROGRAMMING | - |
| dc.subject | M-RING-STAR | - |
| dc.subject | NETWORK DESIGN | - |
| dc.subject | Ciencias de la Computación | - |
| dc.subject | Ciencias de la Computación e Información | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem | - |
| dc.type | info:eu-repo/semantics/article | - |
| dc.type | info:eu-repo/semantics/publishedVersion | - |
| dc.type | info:ar-repo/semantics/articulo | - |
| Aparece en las colecciones: | CONICET | |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.