The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing

Per Olov Lindberg, Gholamreza Razmara. The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing. In Hein A. Fleuren, Dick den Hertog, Peter M. Kort, editors, Operations Research, Proceedings 2004, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Jointly Organized with the Netherlands Society for Operations Research (NGB), Tilburg, The Netherlands, Septembe. pages 360-367, 2004. [doi]

Authors

Per Olov Lindberg

This author has not been identified. Look up 'Per Olov Lindberg' in Google

Gholamreza Razmara

This author has not been identified. Look up 'Gholamreza Razmara' in Google