caa a22 4500 475769228 CHVBK 20180406123615.0 cr unu---uuuuu 170329e20000501xx s 000 0 eng 10.1007/s101070050007 doi (NATIONALLICENCE)springer-10.1007/s101070050007 A branch-and-cut algorithm for the Undirected Rural Postman Problem [Elektronische Daten] [Gianpaolo Ghiani, Gilbert Laporte] Abstract. : The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported. Springer-Verlag Berlin Heidelberg, 2000 Key words: Arc Routing Problems - Undirected Rural Postman Problem - branch-and-cut - polyhedral analysis - facets nationallicence Mathematics Subject Classification (1991): 05c45 nationallicence Ghiani Gianpaolo GERAD, École des Hautes Études Commerciales, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7, e-mail: {ghiani,gilbert}@crt.umontreal.ca, CA aut Laporte Gilbert GERAD, École des Hautes Études Commerciales, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7, e-mail: {ghiani,gilbert}@crt.umontreal.ca, CA aut https://doi.org/10.1007/s101070050007 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s101070050007 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Ghiani Gianpaolo GERAD, École des Hautes Études Commerciales, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7, e-mail: {ghiani,gilbert}@crt.umontreal.ca, CA aut NATIONALLICENCE 700 1- Laporte Gilbert GERAD, École des Hautes Études Commerciales, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7, e-mail: {ghiani,gilbert}@crt.umontreal.ca, CA aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer