Facets and valid inequalities for the time-dependent travelling salesman problem-Reference-Cited by-同舟云学术

Facets and valid inequalities for the time-dependent travelling salesman problem

Published:2014-08 Issue:3 Volume:236 Page:891-902
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Miranda-Bront Juan José,Méndez-Díaz Isabel,Zabala Paula

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference21 articles.

1. The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm;Abeledo,2010

2. Lifted cycle inequalities for the asymmetric traveling salesman problem;Balas;Mathematics of Operations Research,1999

3. On the dimension of projected polyhedra;Balas;Discrete Applied Mathematics,1998

4. The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times;Bigras;Discrete Optimization,2008

5. The delivery man problem and cumulative matroids;Fischetti;Operations Research,1993

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery;European Journal of Operational Research;2022-11

2. A temporal-spatial cleaning optimization method for photovoltaic power plants;Sustainable Energy Technologies and Assessments;2022-02

3. Solving the traveling delivery person problem with limited computational time;Central European Journal of Operations Research;2022-01-20

4. Timeline Club: An optimization algorithm for solving multiple debris removal missions of the time-dependent traveling salesman problem model;Astrodynamics;2021-09-25

5. A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints;European Journal of Operational Research;2021-03