Linear Reformulation of Polynomial Discrete Programming for Fast Computation

References

• Adams WP, Henry SM (2012) Base-2 expansions for linearizing products of functions of discrete variables. Oper. Res. 60(6):1477–1490.Link, Google Scholar
• Akan M, Alagoz O, Ata B, Erenay FS, Said A (2012) A broader view of designing the liver allocation system. Oper. Res. 60(4):757–770.Link, Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization over Integers (Dynamic Ideas, Belmont, MA).Google Scholar
• Dembo RS (1976) A set of geometric programming test problems and their solutions. Math. Programming 10(1):192–213.Crossref, Google Scholar
• Ernst A, Jiang H, Krishnamoorthy M (2006) Exact solutions to task allocation problems. Management Sci. 52(10):1634–1646.Link, Google Scholar
• Glover F, Woolsey L (1974) Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1):180–182.Link, Google Scholar
• Grewal R, Lilien GL, Mallapragada G (2006) Location, location, location: How network embeddedness affects project success in open source systems. Management Sci. 52(7):1043–1056.Link, Google Scholar
• GUROBI (2015) Gurobi optimization, Inc., http://www.gurobi.com.Google Scholar
• Kettani O, Oral M (1990) Equivalent formulations of nonlinear integer problems for efficient optimization. Management Sci. 36(1):115–119.Link, Google Scholar
• Kong N, Schaefer AJ, Hunsaker B, Roberts MS (2010) Maximizing the efficiency of the U.S. liver allocation system through region design. Management Sci. 56(12):2111–2122.Link, Google Scholar
• Li H-L, Lu H-C (2009) Global optimization for generalized geometric programs with mixed free-sign variables. Oper. Res. 57(3):701–713.Link, Google Scholar
• Li H-L, Huang Y-H, Fang S-C (2013) A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems. INFORMS J. Comput. 25(4):643–653.Link, Google Scholar
• Li H-L, Lu H-C, Huang C-H, Hu N-Z (2009) A superior representation method for piecewise linear functions. INFORMS J. Comput. 21(2):314–321.Link, Google Scholar
• Padberg M (2000) Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27(1):1–5.Crossref, Google Scholar
• Pisinger D (2007) The quadratic knapsack problem—A survey. Discrete Appl. Math. 155(5):623–648.Crossref, Google Scholar
• Sanathanam R, Kyparisis GJ (1996) A decision model for interdependent information system project selection. Eur. J. Oper. Res. 89:380–399.Crossref, Google Scholar
• Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J. Mech. Design 112(2):223–229.Crossref, Google Scholar
• Sherali HD, Tuncbilek CH (1997) New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1):1–9.Crossref, Google Scholar
• Sridhar S, Lam F, Blelloch GE, Ravi R, Schwartz R (2008) Mixed integer linear programming for maximum-parsimony phylogeny inference. IEEE/ACM Trans. Comput. Biol. Bioinform. 5(3):323–331.Crossref, Google Scholar
• Tsai JF, Li HL, Hu NZ (2002) Global optimization for signomial discrete programming problems in engineering design. Engrg. Optim. 34(6):613–622.Crossref, Google Scholar
• Vielma JP, Ahmed S, Nemhauser GL (2010) Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper. Res. 58(2):303–315.Link, Google Scholar
• Yıldız S, Vielma JP (2013) Incremental and encoding formulations for mixed integer programming. Oper. Res. Lett. 41(6):654–658.Crossref, Google Scholar
• Zhang M, Batta R, Nagi R (2009) Modeling of workflow congestion and optimization of flow routing in a manufacturing/warehouse facility. Management Sci. 55(2):267–280.Link, Google Scholar