A strong conic quadratic reformulation for machine-job assignment with controllable processing times
暂无分享,去创建一个
Sinan Gürel | Alper Atamtürk | M. Selim Akturk | Alper Atamtürk | S. Gürel | M. S. Akturk | M. S. Aktürk
[1] Oktay Günlük,et al. IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL , 2007 .
[2] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[3] Dvir Shabtay,et al. A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..
[4] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[5] C. Helmberg,et al. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .
[6] N. Sahinidis,et al. Convexification and Global Optimization in Continuous And , 2002 .
[7] Michael A. Trick,et al. Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..
[8] Nikolaos V. Sahinidis,et al. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .
[9] Sinan Gürel,et al. Production, Manufacturing and Logistics Considering manufacturing cost and scheduling performance on a CNC turning machine , 2007 .
[10] Henry Wolkowicz,et al. Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem , 2002, Discret. Appl. Math..
[11] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[12] Donald Goldfarb,et al. Second-order cone programming , 2003, Math. Program..
[13] Michel X. Goemans,et al. Semidefinite programming in combinatorial optimization , 1997, Math. Program..
[14] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[15] Alper Atamtürk,et al. Cuts for Conic Mixed-Integer Programming , 2007, IPCO.
[16] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[17] Claudio Gentile,et al. Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..
[18] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[19] Franz Rendl,et al. A recipe for semidefinite relaxation for (0,1)-quadratic programming , 1995, J. Glob. Optim..
[20] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .
[21] Alper Atamtürk,et al. Lifting for conic mixed-integer programming , 2011, Math. Program..