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

메뉴 건너뛰기

European Journal of Operational Research

Volumn 85, Issue 3, 1995, Pages 610-624

A result on projection for the vehicle routing ptoblem

(1) Gouveia, Luis a

a UNIVERSITY OF LISBON (Portugal)

Author keywords

Mathematical programming; Projection; Vehicle routing

Indexed keywords

EID: 58149318797 PISSN: 03772217 EISSN: None Source Type: Journal
DOI: 10.1016/0377-2217(94)00025-8 Document Type: Article

Times cited : (65)

References (29)

1
- 0000592377
- Parallel Savings Based Heuristics for the Delivery Problem
- (1991) Operations Research , vol.39 , pp. 456-469
- Altinkemer¹ Gavish²

2
- 0343535122
- A polyhedral approach to vehicle routing
- New York
- (1989) presented at the ORSA/TIMS Joint National Meeting
- Araque¹

3
- 0009147546
- Lots of combs of different sizes for vehicle routing
- (1990) CORE Discussion Paper
- Araque¹

4
- 8344241456
- Capacitated trees, capacitated routing and associated polyhedra
- (1990) CORE Discussion Paper
- Araque¹ Hall² Magnanti³

5
- 0026418034
- Polyhedral results for a vehicle routing problem
- (1991) European Journal of Operational Research , vol.52 , pp. 75-85
- Campos¹ Corberan² Mota³

6
- 0001887255
- Vehicle routing
- E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Wiley, New York
- (1985) The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization , pp. 431-448
- Christofides¹

7
- 34250247769
- Exact algorithms for the Vehicle Routing Problem based on spanning trees and shortest path relaxations
- (1981) Mathematical Programming , vol.20 , pp. 255-282
- Christofides¹ Mongozzi² Toth³

8
- 0019572341
- State space relaxation procedures for the computation of bounds for routing problems
- (1981) Networks , vol.11 , pp. 145-164
- Christofides¹ Mongozzi² Toth³

9
- 0000419596
- Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
- (1964) Operations Research , vol.12 , pp. 568-581
- Clarke¹ Wright²

10
- 0027610023
- Polyhedral study of the capacitated vehicle routing problem
- (1993) Mathematical Programming , vol.60 , pp. 21-52
- Cornuejols¹ Harche²

11
- 0019574134
- A generalized assignment heuristic for vehicle routing
- (1981) Networks , vol.11 , pp. 109-124
- Fischer¹ Jaikumar²

12
- 84910897002
- Optimal solution of Vehicle Routing Problems using minimum k-trees
- Department of Decision Sciences, The Wharton School, University of Pennsylvania, Philadelphia, PA
- (1990) Technical Report
- Fischer¹

13
- 0020497080
- Topological design of centralized computer networks: Formulations and algorithms
- (1983) Journal of the ACM , vol.30 , Issue.1 , pp. 118-132
- Gavish¹

14
- 0038979470
- Working Paper
- (1979) The Travelling Salesman Problem and related problems
- Gavish¹ Graves²

15
- 0002554041
- Lagrangean relaxation for integer programming
- (1974) Mathematical Programming Study , vol.2 , pp. 82-114
- Geoffrion¹

16
- 0001535867
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- (1974) Operations Research , vol.22 , pp. 340-349
- Gillet¹ Miller²

17
- 0017502445
- Implementing vehicle routing algorithms
- (1977) Networks , vol.7 , pp. 113-148
- Golden¹ Magnanti² Nguyen³

18
- 0004201432
- Wiley, New York
- (1984) Graphs and Algorithms
- Gondran¹ Minoux²

19
- 0001773019
- A comparison of directed formulations for the capacitated minimal spanning tree problem
- (1993) Telecommunications Systems , vol.1 , pp. 51-76
- Gouveia¹

20
- 0003303487
- A 2n-constraint formulation for the capacitated minimal spanning tree poblem
- (1995) Operations Research
- Gouveia¹

21
- 84910914134
- A classification of formulations for the (time-dependent) Travelling Salesman Problem
- European Journal of Operational Research, EOR, to appear
- (1678) Working Paper No. 2/1992 of the CEAUL-University of Lisbon
- Gouveia¹ Voβ²

22
- 0001644369
- Comb inequalities for the Vehicle Routing Problem
- (1984) Methods of Operations Research , vol.51 , pp. 271-276
- Laporte¹ Nobert²

23
- 0000920459
- Exact algorithms for the Vehicle Routing Problem
- (1987) Annals of Discrete Mathematics , vol.31 , pp. 147-183
- Laporte¹ Nobert²

24
- 0022128780
- Optimal routing under capacity and distance restrictions
- (1985) Operations Research , vol.33 , pp. 1050-1073
- Laporte¹ Nobert² Desrochers³

25
- 0019572333
- Complexity of vehicle routing and scheduling problems
- (1981) Networks , vol.11 , pp. 221-227
- Lenstra¹ Rinnooy Kan²

26
- 2142852323
- Exact solution approaches for the Vehicle Routing Problem
- Imperial College
- (1986) Ph.D. Thesis
- Lucena¹

27
- 0019576149
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
- (1981) Networks , vol.11 , pp. 179-214
- Magnanti¹

28
- 0009394731
- Using separation algorithms to generate mixed integer model reformulations
- (1991) Operations Research Letters , vol.10 , pp. 119-128
- Martin¹

29
- 4544303106
- A branch-and-cut algorithm for the solution of large scale symmetric Traveling Salesman Problems
- (1991) Mathematical Programming , vol.52 , pp. 315-357
- Padberg¹ Rinaldi²

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