The flow set with partial order

Mathematics of Operations Research

Volumn 33, Issue 3, 2008, Pages 730-746

  Atamtürk, Alper ^a   Zhang, Muhong ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b Arizona State University   (United States)

Author keywords

Fixed charge flow; Partially ordered sets; Polyhedra; Precedence constraints

Indexed keywords

COMPUTATIONAL RESULTS; CONVEX HULLS; CUTTING-PLANE ALGORITHMS; FIXED-CHARGE FLOW; FRACTIONAL SOLUTIONS; LIFTING COEFFICIENTS; LINEAR TIME; OPTIMIZATION PROBLEMS; PARTIAL ORDERS; PARTIALLY ORDERED SETS; POLYHEDRA; POLYHEDRAL ANALYSIS; POLYNOMIAL-TIME; PRECEDENCE CONSTRAINTS; ROBUST NETWORKS; SCHEDULING PROBLEMS; SEQUENCE DEPENDENTS; SUBMODULAR; TOTAL ORDERS;

PLANNING; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

SET THEORY;

EID: 61349140058     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0316     Document Type: Article

References (15)

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