Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Méndez Díaz, Isabel | - |
| dc.creator | Zabala, Paula Lorena | - |
| dc.date | 2017-05-16T18:46:58Z | - |
| dc.date | 2017-05-16T18:46:58Z | - |
| dc.date | 2010-02 | - |
| dc.date | 2017-05-15T21:08:46Z | - |
| dc.date.accessioned | 2019-04-29T15:44:05Z | - |
| dc.date.available | 2019-04-29T15:44:05Z | - |
| dc.date.issued | 2017-05-16T18:46:58Z | - |
| dc.date.issued | 2017-05-16T18:46:58Z | - |
| dc.date.issued | 2010-02 | - |
| dc.date.issued | 2017-05-15T21:08:46Z | - |
| dc.identifier | Méndez Díaz, Isabel; Zabala, Paula Lorena; Solving a multicoloring problem with overlaps using integer programming; Elsevier Science; Discrete Applied Mathematics; 158; 4; 2-2010; 349-354 | - |
| dc.identifier | 0166-218X | - |
| dc.identifier | http://hdl.handle.net/11336/16547 | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/300635 | - |
| dc.description | This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes separation heuristics for the valid inequalities, specific initial and primal heuristics, branching and pruning rules. We report on computational experience with random instances. | - |
| dc.description | Fil: Méndez Díaz, Isabel. 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.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.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Elsevier Science | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2009.05.007 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X09002650 | - |
| 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 | GRAPH MULTICOLORING | - |
| dc.subject | INTEGER PROGRAMMING | - |
| dc.subject | BRANCH AND CUT | - |
| dc.subject | Otras Ciencias de la Computación e Información | - |
| dc.subject | Ciencias de la Computación e Información | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | Solving a multicoloring problem with overlaps using integer programming | - |
| 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.