| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
|
G, Young-Gun
|
|
2003
|
31 |
4 |
p. 301-307
7 p.
|
article
|
| 2 |
Accurate calculation of hazardous materials transport risks
|
Kara, B.Y.
|
|
2003
|
31 |
4 |
p. 285-292
8 p.
|
article
|
| 3 |
Approximability of two-machine no-wait flowshop scheduling with availability constraints
|
Cheng, T.C.Edwin
|
|
2003
|
31 |
4 |
p. 319-322
4 p.
|
article
|
| 4 |
Approximative procedures for no-wait job shop scheduling
|
Schuster, Christoph J
|
|
2003
|
31 |
4 |
p. 308-318
11 p.
|
article
|
| 5 |
Computing an obnoxious anchored segment
|
Barcia, J.A.
|
|
2003
|
31 |
4 |
p. 293-300
8 p.
|
article
|
| 6 |
Foundation-penalty cuts for mixed-integer programs
|
Glover, Fred
|
|
2003
|
31 |
4 |
p. 245-253
9 p.
|
article
|
| 7 |
IFC (editor list)
|
|
|
2003
|
31 |
4 |
p. IFC-
1 p.
|
article
|
| 8 |
On the characterization of continuum structure functions
|
Lee, Seung Min
|
|
2003
|
31 |
4 |
p. 268-272
5 p.
|
article
|
| 9 |
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
|
Ng, C.T.
|
|
2003
|
31 |
4 |
p. 323-326
4 p.
|
article
|
| 10 |
Reconstructing edge-disjoint paths
|
Conforti, M.
|
|
2003
|
31 |
4 |
p. 273-276
4 p.
|
article
|
| 11 |
The equivalence between processor sharing and service in random order
|
Borst, S.C.
|
|
2003
|
31 |
4 |
p. 254-262
9 p.
|
article
|
| 12 |
The quickest path problem with batch constraints
|
Calvete, Herminia I.
|
|
2003
|
31 |
4 |
p. 277-284
8 p.
|
article
|
| 13 |
Waiting time distribution of the MAP/D/k system in discrete time—a more efficient algorithm
|
Alfa, Attahiru Sule
|
|
2003
|
31 |
4 |
p. 263-267
5 p.
|
article
|
Journal description