A new rounding procedure for the assignment problem with applications to dense graph arrangement problems Sanjeev AroraAlan FriezeHaim Kaplan Pages: 1 - 36
Objective-derivative-free methods for constrained optimization S. LucidiM. SciandroneP. Tseng Pages: 37 - 59
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective Dimitris BertsimasJay Sethuraman Pages: 61 - 102
A new inexact alternating directions method for monotone variational inequalities Bingsheng HeLi-Zhi LiaoHai Yang Pages: 103 - 118
A faster capacity scaling algorithm for minimum cost submodular flow Lisa FleischerSatoru IwataS. Thomas McCormick Pages: 119 - 139
On generalized trade-off directions in nonconvex multiobjective optimization Kaisa MiettinenMarko M. Mäkelä Pages: 141 - 151
Antiweb-wheel inequalities and their separation problems over the stable set polytopes Eddie ChengSven de Vries Pages: 153 - 175