Volume 77, Issue 2 | Mathematical Programming

New Content Item

Mathematical Programming

A Publication of the Mathematical Optimization Society

Publishing model:: Hybrid

Submit your manuscript

Search all Mathematical Programming articles

Volume 77, Issue 2

May 1997

Filter by

Volume:

Sort by

Date published:

New to old Old to new

4 articles in this issue

On the worst case complexity of potential reduction algorithms for linear programming
Dimitris Bertsimas
Xiaodong Luo
OriginalPaper Pages: 321 - 333
Two generalizations of Dykstra’s cyclic projections algorithm
Hein Hundal
Frank Deutsch
OriginalPaper Pages: 335 - 355
Variation of cost functions in integer programming
Bernd Sturmfels
Rekha R. Thomas
OriginalPaper Pages: 357 - 387
Wheel inequalities for stable set polytopes
Eddie Cheng
William H. Cunningham
OriginalPaper Pages: 389 - 421