A branch-and-cut algorithm for the maximum benefit Chinese...

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

Corberán, Ángel, Plana, Isaac, Rodríguez-Chía, Antonio M., Sanchis, José M.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
141
Language:
english
Journal:
Mathematical Programming
DOI:
10.1007/s10107-011-0507-6
Date:
October, 2013
File:
PDF, 467 KB
english, 2013
Conversion to is in progress
Conversion to is failed