A polyhedral approach to the rural postman problem-Reference-Cited by-同舟云学术

A polyhedral approach to the rural postman problem

Published:1994-11 Issue:1 Volume:79 Page:95-114
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Corberán A.,Sanchis J.M.

Publisher

Elsevier BV

Subject

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

Reference16 articles.

1. Polyhedral results on the Capacited Arc Routing Problem;Belenguer,1990

2. An algorithm for the Rural Postman Problem;Christofides;Imperial College Report,1981

3. The Traveling Salesman Problem on a graph and some related integer polyhedra;Cornuejols;Mathematical Programming,1985

4. Solving large scale Symmetric Traveling Salesman Problems to optimality;Crowder;Management Science,1980

5. Matching, Euler tours and the Chinese Postman;Edmonds;Mathematical Programming,1973

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

1. A branch-and-cut algorithm for the windy profitable location rural postman problem;Annals of Operations Research;2024-08-02

2. Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem;Computers & Operations Research;2024-02

3. Improving a constructive heuristic for the general routing problem;Networks;2022-07-25

4. Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem;Computational Optimization and Applications;2022-06-21

5. Integer programming formulation and polyhedral results for windy collaborative arc routing problem;Computers & Operations Research;2022-06