Inverse integer programming

Optimization Letters

Volumn 3, Issue 4, 2009, Pages 483-489

  Schaefer, Andrew J ^a  

^a University of Pittsburgh   (United States)

Author keywords

Integer programming; Inverse optimization; Polyhedral theory; Superadditive duality

Indexed keywords

ALGORITHMIC APPROACH; INTEGER PROGRAMMING PROBLEMS; INVERSE OPTIMIZATION; POLYHEDRAL THEORY; SUPERADDITIVE DUALITY;

DYNAMIC PROGRAMMING; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 70350066617     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-009-0131-z     Document Type: Article

References (8)

1. Ahuja R.K., Orlin J.B.: Inverse optimization. Oper. Res. 49(5), 771-783 (2001).
2. Cai M.C., Yang X.G., Zhang J.Z.: The complexity analysis of the inverse center location problem. J. Global Optim. 15(2), 213-218 (1999).
3. Francis R.L., McGinnis L.F. Jr, White J.A.: Facility Layout and Location: an Analytical Approach. Prentice Hall, Englewood Cliffs (1992).
4. Hartmann, M.E.: Cutting planes and the complexity of the integer hull. Ph.D thesis, Cornell University (1988).
5. Heuberger C.: Inverse combinatorial optimization: a survey on problems, methods and results. J. Comb. Optim. 8(3), 329-361 (2004).
6. Huang, S.: Inverse problems of some NP-complete problems. In: Lecture Notes in Computer Science, vol. 3251, pp. 422-426. Springer, Heidelberg (2005)._rfaut Huang S.
7. Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988).
8. Zhang J., Liu Z.: Calculating some inverse linear programming problems. J. Comput. Appl. Math. 72(2), 261-273 (1996).