no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A bilevel programming approach to the travelling salesman problem
|
Marcotte, Patrice |
|
2004 |
32 |
3 |
p. 240-248 9 p. |
article |
2 |
A branch and bound algorithm for the robust shortest path problem with interval data
|
Montemanni, R. |
|
2004 |
32 |
3 |
p. 225-232 8 p. |
article |
3 |
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
|
Hong, Sung-Pil |
|
2004 |
32 |
3 |
p. 233-239 7 p. |
article |
4 |
Approximations for Markovian multi-class queues with preemptive priorities
|
van der Heijden, Matthieu |
|
2004 |
32 |
3 |
p. 273-282 10 p. |
article |
5 |
Asymptotics of overflow probabilities in Jackson networks
|
Lee, Jiyeon |
|
2004 |
32 |
3 |
p. 265-272 8 p. |
article |
6 |
Basic optimality results for Bayesian group replacement policies
|
Popova, Elmira |
|
2004 |
32 |
3 |
p. 283-287 5 p. |
article |
7 |
Cutting planes from a mixed integer Farkas lemma
|
Köppe, Matthias |
|
2004 |
32 |
3 |
p. 207-211 5 p. |
article |
8 |
Editorial Board
|
|
|
2004 |
32 |
3 |
p. IFC- 1 p. |
article |
9 |
Finding 2-edge connected spanning subgraphs
|
Huh, Woonghee Tim |
|
2004 |
32 |
3 |
p. 212-216 5 p. |
article |
10 |
Flood search under the California Split rule
|
Baryshnikov, Y. |
|
2004 |
32 |
3 |
p. 199-206 8 p. |
article |
11 |
Local approximations for maximum partial subgraph problem
|
Monnot, Jérôme |
|
2004 |
32 |
3 |
p. 217-224 8 p. |
article |
12 |
On the robustness of batching estimators
|
Yeh, Yingchieh |
|
2004 |
32 |
3 |
p. 293-298 6 p. |
article |
13 |
Preemptive scheduling of equal-length jobs to maximize weighted throughput
|
Baptiste, Philippe |
|
2004 |
32 |
3 |
p. 258-264 7 p. |
article |
14 |
Reliability analysis of a renewable multiple cold standby system
|
Vanderperre, Edmond J. |
|
2004 |
32 |
3 |
p. 288-292 5 p. |
article |
15 |
Sorting weighted distances with applications to objective function evaluations in single facility location problems
|
Tamir, Arie |
|
2004 |
32 |
3 |
p. 249-257 9 p. |
article |