Convex quadratic and semidefinite programming relaxations in scheduling
暂无分享,去创建一个
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[3] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[5] L. Khachiyan,et al. The polynomial solvability of convex quadratic programming , 1980 .
[6] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[7] Katta G. Murty,et al. POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING , 1981 .
[8] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[9] Seiki Kyan,et al. Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..
[10] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[11] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[12] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[13] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[14] Mihalis Yannakakis,et al. Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.
[15] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[16] Mihalis Yannakakis,et al. Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..
[17] Xiaotie Deng,et al. Deterministic load balancing in computer networks , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.
[18] Martin E. Dyer,et al. Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..
[19] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[20] Baruch Awerbuch,et al. Competitive distributed job scheduling (extended abstract) , 1992, STOC '92.
[21] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[22] Prabhakar Raghavan. Randomized Approximation Algorithms in Combinatorial Optimization , 1994, FSTTCS.
[23] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[24] Uriel Feige,et al. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[25] Ramesh Hariharan,et al. Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[26] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[27] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[28] Cynthia A. Phillips,et al. Improved Scheduling Algorithms for Minsum Criteria , 1996, ICALP.
[29] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[30] David B. Shmoys,et al. Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.
[31] Rolf H. Möhring,et al. Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract) , 1996, ESA.
[32] Dimitris Bertsimas,et al. On Dependent Randomized Rounding Algorithms , 1996, IPCO.
[33] Cynthia A. Phillips,et al. Task Scheduling in Networks , 1997, SIAM J. Discret. Math..
[34] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.
[35] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..
[36] Michel X. Goemans,et al. Semideenite Programming in Combinatorial Optimization , 1999 .
[37] Michel X. Goemans,et al. Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.
[38] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[39] Martin W. P. Savelsbergh,et al. An experimental study of LP-based approximation algorithms for scheduling problems , 1998, SODA '98.
[40] Cynthia A. Phillips,et al. Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem , 1998, J. Comb. Optim..
[41] Cynthia A. Phillips,et al. Minimizing average completion time in the presence of release dates , 1998, Math. Program..
[42] Madhu Sudan,et al. A Geometric Approach to Betweenness , 1995, ESA.
[43] Martin Skutella,et al. Semidefinite relaxations for parallel machine scheduling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[44] Maurice Queyranne,et al. Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.
[45] David R. Karger,et al. Techniques for scheduling with rejection , 1998, J. Algorithms.
[46] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[47] Gerhard J. Woeginger,et al. Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .
[48] Evripidis Bampis,et al. Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[49] Gerhard J. Woeginger,et al. A PTAS for minimizing the weighted sum of job completion times on parallel machines , 1999, STOC '99.
[50] Sanjeev Mahajan,et al. Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..
[51] Fabián A. Chudak. A min‐sum 3/2‐approximation algorithm for scheduling unrelated parallel machines , 1999 .
[52] Martin Skutella,et al. Convex Quadratic Programming Relaxations for Network Scheduling Problems , 1999, ESA.
[53] Uri Zwick,et al. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.
[54] Mark S. Squillante,et al. Optimal scheduling of multiclass parallel machines , 1999, SODA '99.
[55] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[56] David P. Williamson,et al. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..
[57] Gerhard J. Woeginger,et al. A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines , 2000, Math. Oper. Res..
[58] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[59] Han Hoogeveen,et al. Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..
[60] Yinyu Ye,et al. A .699-Approximation Algorithm for Max-Bisection , 1999 .
[61] Martin Skutella,et al. Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..
[62] Martin Skutella,et al. The power of -points in preemptive single machine scheduling , 2002 .
[63] Martin Skutella,et al. Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..
[64] Zhao Chuan-li. Scheduling to Minimize the Weighted Sum of Completion Times , 2003 .