- -

The stacker crane problem and the directed general routing problem

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

The stacker crane problem and the directed general routing problem

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: The_stacker_crane ...
Tamaño: 1.338Mb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: SC&DGRP_Thais_NET ...
Tamaño: 493.8Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Ávila, Thais es_ES
dc.contributor.author Corberán, Angel es_ES
dc.contributor.author Plana, Isaac es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2018-03-25T04:27:21Z
dc.date.available 2018-03-25T04:27:21Z
dc.date.issued 2015 es_ES
dc.identifier.issn 0028-3045 es_ES
dc.identifier.uri http://hdl.handle.net/10251/99717
dc.description This is the peer reviewed version of the following article: Ávila, Thais , Corberán, Angel, Plana, Isaac, Sanchís Llopis, José María. (2015). The stacker crane problem and the directed general routing problem.Networks, 65, 1, 43-55. DOI: 10.1002/net.21591 , which has been published in final form at http://doi.org/10.1002/net.21591. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving
dc.description.abstract [EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included. es_ES
dc.description.sponsorship Contract grant sponsor: Ministerio de Economía y Competitividad (project MTM2012-36163-C06-02) of Spain Contract grant sponsor: Generalitat Valenciana (project GVPROMETEO2013-049)
dc.language Inglés es_ES
dc.publisher John Wiley & Sons es_ES
dc.relation.ispartof Networks es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Directed rural postman problem es_ES
dc.subject Directed general routing problem es_ES
dc.subject Stacker crane problem es_ES
dc.subject Branch-and-cut algorithm es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title The stacker crane problem and the directed general routing problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1002/net.21591 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//MTM2012-36163-C06-02/ES/MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada es_ES
dc.description.bibliographicCitation Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2015). The stacker crane problem and the directed general routing problem. Networks. 65(1):43-55. https://doi.org/10.1002/net.21591 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://doi.org/10.1002/net.21591 es_ES
dc.description.upvformatpinicio 43 es_ES
dc.description.upvformatpfin 55 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 65 es_ES
dc.description.issue 1 es_ES
dc.relation.pasarela S\280889 es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES
dc.contributor.funder Generalitat Valenciana es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem