search query: @indexterm Routing problem / total: 31
reference: 14 / 31
| Author: | Letchford, A. |
| Title: | New inequalities for the general routing problem |
| Journal: | European Journal of Operational Research
1997 : JAN 24, VOL. 96:2, p. 317-322 |
| Index terms: | OPERATIONAL RESEARCH ECONOMICS ROUTING PROBLEM |
| Language: | eng |
| Abstract: | A large new class of valid inequalities is introduced for the General Routing Problem which properly contains the class of "K-C constraints". These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time. The General Routing Problem or GRP is an NP-hard vehicle routing problem in which both vertices and edges may require service. It includes the Rural Postman Problem and the Road Travelling Salesman Problem as special cases. |
SCIMA