About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Report

A Note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint

From

Department of Computer Science, Faculty of Science, Københavns Universitet

Department of Computer Science, Department of Computer Science, Faculty of Science, Københavns Universitet

Language: English
Publisher: Department of Computer Science, University of Copenhagen
Year: 2008
Series: Department of Computer Science. University of Copenhagen. Technical Report
ISSN: 01078283
Types: Report

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access