A note on maximizing a submodular set function subject to a knapsack constraint
- Maxim Sviridenko
- 2004
- Operations Research Letters
Publications
Date
Featured collections
Popular topics
50 results at Operations Research Letters
A linear time approximation scheme for makespan minimization in an open shop with release dates
- Alexander Kononov
- Maxim Sviridenko
- 2002
- Operations Research Letters
1.47-Approximation algorithm for a preemptive single-machine scheduling problem
- Michel X. Goemans
- Joel M. Wein
- et al.
- 2000
- Operations Research Letters
On the k-cut problem
- Francisco Barahona
- 2000
- Operations Research Letters
Half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Fabián A. Chudak
- Dorit S. Hochbaum
- 1999
- Operations Research Letters
Improving aggregation bounds for two-stage stochastic programs
- Charles H. Rosa
- Samer Takriti
- 1999
- Operations Research Letters
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Fabián A. Chudak
- Michel X. Goemans
- et al.
- 1998
- Operations Research Letters
Some applications of nonnegative linear systems: Farkas strikes again
- Robin Lougee-Heimer
- Warren P. Adams
- et al.
- 1994
- Operations Research Letters
Linear time algorithms for some separable quadratic programming problems
- Nimrod Megiddo
- Arie Tamir
- 1993
- Operations Research Letters
Separating from the dominant of the spanning tree polytope
- Francisco Barahona
- 1992
- Operations Research Letters