Minimization of Half-Products

References

• Arora S. , Lund C. , Motwani R. , Sudan M. , Szegedy M. Proof verification and hardness of approximation problems. Proc. 33rd Annual Sympos. Foundations of Computer Science (1992) 14 23 Crossref, Google Scholar
• Boros E. , Hammer P. L. The max-cut problem and quadratic 0 – 1 optimization. Polyhedral aspects, relaxations and bounds. Ann. Oper. Res. (1991) 33 151 180 Crossref, Google Scholar
• De P. , Gosh Jay B. , Wells Charles E. On the minimization of completion time variance with a bicriteria extension. Oper. Res. (1992) 40 1148 1155 Link, Google Scholar
• Deza M. , Laurent M. Application of cut polyhedra. (1992) . Research report BS-R9221, Center for Mathematics and Computer Science, Amsterdam, The Netherlands Google Scholar
• Eilon S. , Chowdhury I. G. Minimizing waiting time variance in the single machine problem. Management Sci. (1977) 23 567 575 Link, Google Scholar
• Garey M. R. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
• Kubiak W. Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. (1993) 14 49 59 Crossref, Google Scholar
• Padberg M. The Boolean quadric polytope: Some characteristics, facets and relatives. Math. Programming (1989) 45 139 172 Crossref, Google Scholar
• Palubeckis G. Quadratic 0–1 optimization. Informatika (1990) 1 89 106 Google Scholar