default search action
"A branch-and-cut algorithm for capacitated network design problems."
Oktay Günlük (1999)
- Oktay Günlük:
A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86(1): 17-39 (1999)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.