|
|||||
|
|
New inequalities for the General Routing Problem |
|
| Institution: | 1. Department of Information Engineering, University of Brescia, Brescia, Italy;2. Department of Statistics and Operational Research, University of Valencia, Burjassot, Spain;3. Department of Mathematics for Economics and Business, University of Valencia, Valencia, Spain;4. Department of Applied Mathematics, Polytechnic University of Valencia, Valencia, Spain |
| 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |