| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A class of on-line scheduling algorithms to minimize total completion time
|
Lu, X.
|
|
2003
|
31 |
3 |
p. 232-236
5 p.
|
article
|
| 2 |
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem
|
Ahuja, Ravindra K.
|
|
2003
|
31 |
3 |
p. 185-194
10 p.
|
article
|
| 3 |
A maximum flow algorithm using MA ordering
|
Fujishige, Satoru
|
|
2003
|
31 |
3 |
p. 176-178
3 p.
|
article
|
| 4 |
An O(n log n) procedure for identifying facets of the knapsack polytope
|
Escudero, Laureano F.
|
|
2003
|
31 |
3 |
p. 211-218
8 p.
|
article
|
| 5 |
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
|
Hassin, Refael
|
|
2003
|
31 |
3 |
p. 179-184
6 p.
|
article
|
| 6 |
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
|
Calvin, James M.
|
|
2003
|
31 |
3 |
p. 202-210
9 p.
|
article
|
| 7 |
Explicit results for wear processes in a Markovian environment
|
Kharoufeh, Jeffrey P.
|
|
2003
|
31 |
3 |
p. 237-244
8 p.
|
article
|
| 8 |
IFC (editor list)
|
|
|
2003
|
31 |
3 |
p. IFC-
1 p.
|
article
|
| 9 |
Local search for the minimum label spanning tree problem with bounded color classes
|
Brüggemann, Tobias
|
|
2003
|
31 |
3 |
p. 195-201
7 p.
|
article
|
| 10 |
Mirror descent and nonlinear projected subgradient methods for convex optimization
|
Beck, Amir
|
|
2003
|
31 |
3 |
p. 167-175
9 p.
|
article
|
| 11 |
The three-machine proportionate flow shop problem with unequal machine speeds
|
Hou, Sixiang
|
|
2003
|
31 |
3 |
p. 225-231
7 p.
|
article
|
| 12 |
The two-machine open shop problem: To fit or not to fit, that is the question
|
van den Akker, Marjan
|
|
2003
|
31 |
3 |
p. 219-224
6 p.
|
article
|
Journal description