A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems

References

• Ceselli A, Righini G (2005) A branch-and-price algorithm for the capacitated p-median problem. Networks 45(3):125–142.Crossref, Google Scholar
• Ceselli A, Righini G (2006) A branch-and-price algorithm for the multilevel generalized assignment problem. Oper. Res. 54(6):1172–1184.Link, Google Scholar
• Ernst A, Jiang H, Krishnamoorthy M (2006) Exact solutions to task allocation problems. Management Sci. 52(10):1634–1646.Link, Google Scholar
• Fischetti M, Lodi A, Martello S, Toth P (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. 47(6):833–850.Link, Google Scholar
• Glover F, Hultz J, Klingman D (1979) Improved computer-based planning techniques. Part II. Interfaces 9(4):12–20.Link, Google Scholar
• Hadj-Alouane AB, Bean JC, Murty KG (1999) A hybrid genetic/optimization algorithm for a task allocation problem. J. Scheduling 2(4):189–201.Crossref, Google Scholar
• Hamam Y, Hindi KS (2000) Assignment of program modules to processors: A simulated annealing approach. Eur. J. Oper. Res. 122(5):509–513.Crossref, Google Scholar
• Henry SM (2011) Tight polyhedral representations of discrete sets using projections, simplices, and base-2 expansions. Ph.D. thesis, Clemson University, Clemson, SC.Google Scholar
• IBM/ILOG (2009) CPLEX 12.0 reference manual. http://www.ilog.com/products/cplex/.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
• Li HL, Lu HC (2009) Global optimization for generalized geometric programs with mixed free-sign variables. Oper. Res. 57(3):701–713.Link, Google Scholar
• Li HL, Lu HC, Huang CH, Hu NZ (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
• Padberg MW, Rijal MP (1996) Location, Scheduling, Design, and Integer Programming (Kluwer Academic Publishers, Boston).Crossref, Google Scholar
• Savelsbergh M (1997) A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6):831–841.Link, Google Scholar
• Vielma JP, Nemhauser GL (2011) Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Programming 128(1):49–72.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