The Flow Set with Partial Order

References

• Aghezzaf E. H., Magnanti T. L., Wolsey L. A. Optimizing constrained subtrees of trees. Math. Programming (1995) 71(2):113–126Crossref, Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall)Google Scholar
• Atamtürk A. Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. (2001) 29(3):107–114Crossref, Google Scholar
• Atamtürk A. Sequence independent lifting for mixed-integer programming. Oper. Res. (2004) 52(3):487–490Link, Google Scholar
• Atamtürk A., Günlük O. Network design arc set with variable upper bounds. Networks (2007) 50(1):17–28Crossref, Google Scholar
• Atamtürk A., Zhang M. Two-stage robust network flow and design under demand uncertainty. Oper. Res. (2007) 55(4):662–673Link, Google Scholar
• Boyd E. A. Polyhedral results for the precedence-constrained knapsack problem. Discrete Appl. Math. (1993) 41(3):185–201Crossref, Google Scholar
• Gu Z., Nemhauser G. L., Savelsbergh M. W. P. Lifted flow cover inequalities for mixed 0–1 integer programs. Math. Programming (1999) 85(3):439–467Crossref, Google Scholar
• Gu Z., Nemhauser G. L., Savelsbergh M. W. P. Sequence independent lifting in mixed integer programming. J. Combin. Optim. (2000) 4(1):109–129Crossref, Google Scholar
• Hochbaum D. S., Chen A. Performance analysis and best implementations of old and new algorithms for the open-pit mining problem. Oper. Res. (2000) 48(6):894–914Link, Google Scholar
• Kis T. A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math. Programming (2005) 103(3):515–539Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Padberg M. W., Van Roy T. J., Wolsey L. A. Valid linear inequalities for fixed charge problems. Oper. Res. (1984) 32(4):842–861Link, Google Scholar
• Park K., Park S. Lifting cover inequalities for the precedence-constrained knapsack problems. Discrete Appl. Math. (1997) 72(3):219–241Crossref, Google Scholar
• van de Leensel R. L. M. J., van Hoesel C. P. M., van de Klundert J. J. Lifting valid inequalities for the precedence-constrained knapsack problem. Math. Programming (1999) 86(1):161–185Crossref, Google Scholar