1. Lifted flow cover inequalities for mixed 0-1 integer programs

   • Zonghao Gu
   • George L. Nemhauser
   • Martin W.P. Savelsbergh

   Pages: 439 - 467

2. A method of projection onto an acute cone with level control in convex minimization

   • Andrzej Cegielski

   Pages: 469 - 490

3. An interior Newton method for quadratic programming

   • Thomas F. Coleman
   • Jianguo Liu

   Pages: 491 - 523

4. Conditioning of semidefinite programs

   • Madhu V. Nayakkankuppam
   • Michael L. Overton

   Pages: 525 - 540

5. A polyhedral approach to single-machine scheduling problems

   • J.M. van den Akker
   • C.P.M. van Hoesel
   • M.W.P. Savelsbergh

   Pages: 541 - 572

6. A symmetrical linear maxmin approach to disjoint bilinear programming

   • Charles Audet
   • Pierre Hansen
   • Gilles Savard

   Pages: 573 - 592

7. Finiteness of conical algorithms with ω-subdivisions

   • M. Locatelli

   Pages: 593 - 616

8. Fixed–charge continuous knapsack problems and pseudogreedy solutions

   • Josef Haberl

   Pages: 617 - 642

9. A parametric view on the Mangasarian–Fromovitz constraint qualification

   • Martin Gugat

   Pages: 643 - 653