A note on the Undirected Rural Postman Problem polytope |
| |
Authors: | Gerhard Reinelt Dirk Oliver Theis |
| |
Affiliation: | (1) University of Heidelberg, Germany |
| |
Abstract: | This note refers to the article by G. Ghiani and G. Laporte ``A branch-and-cut algorithm for the Undirected Rural Postman Problem', Math. Program. 87 (2000). We show that some conditions for the facet-defining property of the basic non-trivial inequalities are not sufficient and that the Rural Postman Problem polytope is more complex even when focusing on canonical inequalities only. |
| |
Keywords: | 90C57 05c45 |
本文献已被 SpringerLink 等数据库收录! |