| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A constrained independent set problem for matroids
|
Fleiner, Tamás
|
|
2004
|
32 |
1 |
p. 23-26
4 p.
|
article
|
| 2 |
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
|
Grosso, A
|
|
2004
|
32 |
1 |
p. 68-72
5 p.
|
article
|
| 3 |
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
|
Wierman, Adam
|
|
2004
|
32 |
1 |
p. 73-76
4 p.
|
article
|
| 4 |
A note on maximizing a submodular set function subject to a knapsack constraint
|
Sviridenko, Maxim
|
|
2004
|
32 |
1 |
p. 41-43
3 p.
|
article
|
| 5 |
A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP
|
Prékopa, András
|
|
2004
|
32 |
1 |
p. 59-67
9 p.
|
article
|
| 6 |
Continuous benchmark selections
|
Hougaard, Jens Leth
|
|
2004
|
32 |
1 |
p. 94-98
5 p.
|
article
|
| 7 |
Editorial Board
|
|
|
2004
|
32 |
1 |
p. IFC-
1 p.
|
article
|
| 8 |
Lexicographic balanced optimization problems
|
Punnen, Abraham P.
|
|
2004
|
32 |
1 |
p. 27-30
4 p.
|
article
|
| 9 |
Models for representing piecewise linear cost functions
|
Keha, Ahmet B.
|
|
2004
|
32 |
1 |
p. 44-48
5 p.
|
article
|
| 10 |
Monotonizing linear programs with up to two nonzeroes per column
|
Hochbaum, Dorit S.
|
|
2004
|
32 |
1 |
p. 49-58
10 p.
|
article
|
| 11 |
On the complexity of the robust spanning tree problem with interval data
|
Aron, Ionuţ D.
|
|
2004
|
32 |
1 |
p. 36-40
5 p.
|
article
|
| 12 |
On the directed hop-constrained shortest path problem
|
Dahl, Geir
|
|
2004
|
32 |
1 |
p. 15-22
8 p.
|
article
|
| 13 |
On the nearest neighbor rule for the traveling salesman problem
|
Hurkens, Cor A.J.
|
|
2004
|
32 |
1 |
p. 1-4
4 p.
|
article
|
| 14 |
On the two-dimensional Knapsack Problem
|
Caprara, Alberto
|
|
2004
|
32 |
1 |
p. 5-14
10 p.
|
article
|
| 15 |
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
|
Choi, Bong Dae
|
|
2004
|
32 |
1 |
p. 85-93
9 p.
|
article
|
| 16 |
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
|
Shioura, Akiyoshi
|
|
2004
|
32 |
1 |
p. 31-35
5 p.
|
article
|
| 17 |
The N threshold policy for the GI/M/1 queue
|
Zhang, Zhe George
|
|
2004
|
32 |
1 |
p. 77-84
8 p.
|
article
|
Journal description