From personal interest and also on behalf of the Mathematical Programming Society I have been trying to keep afloat in the flood of writing that followed Khachian's "Polynomial Time Algorithm for Linear Programming" (Khachian, L. G. 1979. A polynomial algorithm in linear programming. Dokl. Akad....

There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is...

We consider the Capacitated Economic Lot Size Problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A straightforward dynamic programming approach to this problem results in an O(n ² c\bar d\bar ) algorithm,...

The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance. A worst-case study establishes the...