Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Miranda Bront, Juan Jose | - |
| dc.creator | Méndez-Díaz, Isabel | - |
| dc.creator | Zabala, Paula Lorena | - |
| dc.date | 2018-01-02T18:00:04Z | - |
| dc.date | 2018-01-02T18:00:04Z | - |
| dc.date | 2013-05 | - |
| dc.date | 2017-12-29T17:30:47Z | - |
| dc.date.accessioned | 2019-04-29T15:28:31Z | - |
| dc.date.available | 2019-04-29T15:28:31Z | - |
| dc.date.issued | 2018-01-02T18:00:04Z | - |
| dc.date.issued | 2018-01-02T18:00:04Z | - |
| dc.date.issued | 2013-05 | - |
| dc.date.issued | 2017-12-29T17:30:47Z | - |
| dc.identifier | Zabala, Paula Lorena; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Facets and valid inequalities for the time-dependent travelling salesman problem; Elsevier Science; European Journal of Operational Research; 236; 3; 5-2013; 891-902 | - |
| dc.identifier | 0377-2217 | - |
| dc.identifier | http://hdl.handle.net/11336/31995 | - |
| dc.identifier | CONICET Digital | - |
| dc.identifier | CONICET | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/294781 | - |
| dc.description | The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm. | - |
| dc.description | Fil: Miranda Bront, Juan Jose. 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: 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.ejor.2013.05.022 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0377221713004219 | - |
| 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 | Combinatorial optimization | - |
| dc.subject | Integer Programming | - |
| dc.subject | Time-Dependent TSP | - |
| dc.subject | Branch and Cut | - |
| 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 | Facets and valid inequalities for the time-dependent travelling salesman 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.