SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Transportation Science

Volumn 36, Issue 2, 2002, Pages 250-269

A branch-and-cut procedure for the vehicle routing problem with time windows

(3) Bard, Jonathan F a Kontoravdis, George a Yu, Gang a

a The University of Texas at Austin (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; LINEAR PROGRAMMING; OPTIMIZATION; TRAFFIC SURVEYS;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); VECHILE ROUTING PROBLEM;

MOTOR TRANSPORTATION;

EID: 0036567019 PISSN: 00411655 EISSN: None Source Type: Journal
DOI: 10.1287/trsc.36.2.250.565 Document Type: Article

Times cited : (106)

References (31)

1
- 21844515997
- A branch-and-cut algorithm for vehicle routing problems
- (1994) Ann. Oper. Res. , vol.50 , pp. 37-59
- Araque, J.R.¹ Kudva, G.² Morin, T.³ Pekny, J.F.⁴

2
- 25144497883
- Preprint SC 99-31. Konard-Zuse-Zentrum für Informationstechnik, Berlin, Germany
- (1999) Solving the asymmetric travelling salesman problem with time windows by branch and cut
- Ascheuer, N.¹ Fischetti, M.² Grötschel, M.³

3
- 85029841425
- Ph.D. thesis, Institut National Polytechnique de Grenoble, Grenoble, France
- (1995) Approache polyédrale du problème de tournnées de véhicules
- Augerat, P.¹

4
- 0020504118
- Routing and scheduling of vehicles and crews - The state of the art
- (1983) Comput. Oper. Res. , vol.10 , pp. 63-211
- Bodin, L.B.¹ Golden, B.L.² Assad, A.A.³ Ball, M.O.⁴

5
- 3342976993
- A parallel cutting plan algorithm for the vehicle routing problem with time windows
- Technical report, Rice University, Houston, TX
- (1999) Computational and Applied Mathematics
- Cook, W.¹ Rich, J.L.²

6
- 0027610023
- Polyhedral study of the capacitated vehicle routing
- (1993) Math. Programming , vol.60 , pp. 21-52
- Cornuéjols, G.¹ Harche, F.²

7
- 85042163696
- A new optimization algorithm for the vehicle routing problem with time windows
- (1992) Oper. Res. , vol.40 , pp. 342-354
- Desrochers, M.¹ Desrosiers, J.² Solomon, M.M.³

8
- 0002509314
- Vehicle routing with time windows: Optimization and approximation
- B. L. Golden, and A. A. Assad, eds. North-Holland, Amsterdam, The Netherlands
- (1988) Vehicle Routing: Methods and Studies , pp. 65-84
- Lenstra, J.K.¹ Savelsbergh, M.W.P.² Soumis, F.³

9
- 77957089136
- Time constrained routing and scheduling
- M. O. Ball, T. L. Magnati, C. L. Monma, and G. L. Nemhauser, eds., North-Holland, Amsterdam, The Netherlands
- (1995) Handbooks in Operations Research and Management Science: Network Routing , vol.8 , pp. 35-139
- Desrosiers, J.¹ Dumas, Y.² Solomon, M.M.³ Soumis, F.⁴

10
- 0031271921
- A polyhedral approach to the asymmetric travelling salesman problem
- (1997) Management Sci. , vol.43 , pp. 1520-1536
- Fischetti, M.¹ Toth, P.²

11
- 0001278313
- Solving the orienteering problem through branch-and-cut
- (1998) INFORMS J. Comput. , vol.10 , pp. 133-148
- Salazar González, J.J.¹ Toth, P.²

12
- 84945709831
- Algorithm 97, shortest path
- (1962) Comm. ACM , vol.5 , pp. 345
- Floyd, R.¹

13
- 0006138747
- Working paper, ARTEMIS-IMAG, Université de Grenoble, Grenoble, France
- (1994) On the edge-connectivity algorithm of Nagamochi and Ibaraki
- Frank, A.¹

14
- 0000748672
- Multiterminal network flows
- (1961) SIAM J. Appl. Math. , vol.9 , pp. 551-570
- Gomory, R.E.¹ Hu, T.C.²

15
- 0002753134
- Polyhedral theory
- E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, eds. Wiley, Chichester, U.K.
- (1985) The Traveling Salesman Problem , pp. 251-306
- Grötschel, M.¹ Padberg, M.W.²

16
- 0027614308
- Solving airline crew scheduling problems by branch-and-cut
- (1993) Management Sci. , vol.39 , pp. 657-683
- Hoffman, K.L.¹ Padberg, M.W.²

17
- 0004297788
- Ph.D. thesis, Technical University of Denmark, Lyngby, Denmark
- (1995) Exact methods for time constrained routing and related scheduling problems
- Kohl, N.¹

18
- 0031140531
- An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation
- (1997) Oper. Res. , vol.45 , pp. 395-406
- Madsen, O.B.G.¹

19
- 0000276553
- Two-path cuts for the vehicle routing problem with time windows
- (1999) Transportation Sci. , vol.33 , pp. 101-116
- Desrosiers, J.¹ Madsen, O.B.G.² Solomon, M.M.³ Soumis, F.⁴

20
- 4243863039
- Ph.D. thesis, Graduate Program in Operations Research, The University of Texas, Austin, TX
- (1997) The vehicle routing problem with time windows
- Kontoravdis, G.¹

21
- 0003047320
- A GRASP for the vehicle.routing problem with time windows
- (1995) ORSA J. Comput. , vol.7 , pp. 10-23
- Bard, J.F.¹

22
- 0001644369
- Comb inequalities for the vehicle routing problem
- (1984) Methods Oper. Res. , vol.51 , pp. 271-276
- Laporte, G.¹ Nobert, Y.²

23
- 0002659735
- Computing edge-connectivity in multigraphs and capacitated graphs
- (1992) SIAM J. Discrete Math. , vol.5 , pp. 54-66
- Nagamochi, H.¹ Ibaraki, T.²

24
- 0003586442
- Wiley, New York
- (1988) Integer and Combinatorial Optim.
- Nemhauser, G.L.¹ Wolsey, L.A.²

25
- 0003036173
- An efficient algorithm for the minimum capacity cut problem
- (1990) Math. Programming , vol.47 , pp. 19-36
- Padberg, M.W.¹ Rinaldi, G.²

26
- 0025448140
- Facet identification for the symmetric traveling salesman polytope
- (1990) Math. Programming , vol.47 , pp. 219-257

27
- 0026124209
- A branch-and-cut algorithm for the resolution of large scale symmetric traveling salesman problems
- (1991) SIAM Rev. , vol.33 , pp. 60-100

28
- 0006190960
- A computational study of vehicle routing problem applications
- Ph.D. thesis, Rice University, Houston, TX
- (1999) Computational and Applied Mathematics
- Rich, J.L.¹

29
- 40649112559
- A branch-and-price algorithm for the pickup and delivery problem with time windows
- Department of Mathematics and Computing Science, Eindoven University of Technology, Eindoven, The Netherlands
- (1994) Memorandum COSOR , vol.94 , Issue.22
- Sol, M.¹ Savelsbergh, M.W.P.²

30
- 0023313252
- Algorithms for the vehicle routing and scheduling problem with time window constraints
- (1987) Oper. Res. , vol.35 , pp. 254-265
- Solomon, M.M.¹

31
- 0023964259
- Time window constrained routing and scheduling problems
- (1988) Transportation Sci. , vol.22 , pp. 1-13
- Desrosiers, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.