Author:
Royset Johannes O.,Wood R. Kevin
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Reference25 articles.
1. Explicit-Constraint Branching for Solving Mixed-Integer Programs
2. Enumerating Near-Min S-T Cuts
3. Bingol L. A Lagrangian heuristic for solving a network interdiction problem. (2001) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CA
4. Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献