News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem

Berinski, Hernán et al · Elsevier · 2011

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Berinski, Hernán et al
Publisher
Elsevier
Year
2011
ISSN
1571-0653
ISSN
1571-0653
Language
English

Resource access

Open the content from the main option or choose another available source.

CONICET Digital CONICET Digital OAI-PMH
Entrar por CONICET Digital
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

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. Fil: Berinski, Hernán. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina 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

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Berinski, H. E. A. (2011). An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. http://hdl.handle.net/11336/68447

MLA

Berinski, Hernán et al. "An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem." 2011. http://hdl.handle.net/11336/68447.

Chicago

Berinski, Hernán et al. 2011. "An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem.". http://hdl.handle.net/11336/68447.

Harvard

Berinski, H. E. A. 2011, An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem, Elsevier, available at: http://hdl.handle.net/11336/68447 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem
Author / contributors
Berinski, Hernán et al
Publisher
Elsevier
Publication year
2011
ISSN
1571-0653
ISSN
1571-0653
Language
English

Subjects

Explore related resources through these subjects.

Branch-And-Cut; Integer Programming; M-Ring-Star; Network Design; https://purl.org/becyt/ford/1.2; https://purl.org/becyt/ford/1
Copied