no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A decomposition algorithm for network reliability evaluation
|
Carlier, Jacques |
|
1996 |
65 |
1-3 |
p. 141-156 16 p. |
article |
2 |
A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
|
Dai, Yang |
|
1996 |
65 |
1-3 |
p. 167-190 24 p. |
article |
3 |
An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
|
Hertz, Alain |
|
1996 |
65 |
1-3 |
p. 319-345 27 p. |
article |
4 |
A note on perfectly orderable graphs
|
Hoàng, Chinh T. |
|
1996 |
65 |
1-3 |
p. 379-386 8 p. |
article |
5 |
A polynomial algorithm for the parity path problem on perfectly orientable graphs
|
Arikati, Srinivasa R. |
|
1996 |
65 |
1-3 |
p. 5-20 16 p. |
article |
6 |
Author index
|
|
|
1996 |
65 |
1-3 |
p. 441-442 2 p. |
article |
7 |
Cardinality-restricted chains and antichains in partially ordered sets
|
Shum, Henry |
|
1996 |
65 |
1-3 |
p. 421-439 19 p. |
article |
8 |
Deadline scheduling of multiprocessor tasks
|
Blazewicz, J. |
|
1996 |
65 |
1-3 |
p. 81-95 15 p. |
article |
9 |
Editorial Board
|
|
|
1996 |
65 |
1-3 |
p. ix-x nvt p. |
article |
10 |
Ejection chains, reference structures and alternating path methods for traveling salesman problems
|
Glover, Fred |
|
1996 |
65 |
1-3 |
p. 223-253 31 p. |
article |
11 |
Graphs that admit 3-to-1 or 2-to-1 maps onto the circle
|
Hilton, A.J.W. |
|
1996 |
65 |
1-3 |
p. 347-377 31 p. |
article |
12 |
Graphs with largest number of minimum cuts
|
Lehel, Jenő |
|
1996 |
65 |
1-3 |
p. 387-407 21 p. |
article |
13 |
Improving local search heuristics for some scheduling problems—I
|
Brucker, Peter |
|
1996 |
65 |
1-3 |
p. 97-122 26 p. |
article |
14 |
Laplacian spectra and spanning trees of threshold graphs
|
Hammer, P.L. |
|
1996 |
65 |
1-3 |
p. 255-273 19 p. |
article |
15 |
Lot-size scheduling of two types of jobs on identical machines
|
Pattloch, Marcus |
|
1996 |
65 |
1-3 |
p. 409-419 11 p. |
article |
16 |
On a scheduling problem in a robotized analytical system
|
Hertz, Alain |
|
1996 |
65 |
1-3 |
p. 285-318 34 p. |
article |
17 |
On preemptive scheduling: A general setting for the two-phase method
|
Cochand, M. |
|
1996 |
65 |
1-3 |
p. 157-166 10 p. |
article |
18 |
On some multicriteria arborescence problems: Complexity and algorithms
|
Dell'Amico, Mauro |
|
1996 |
65 |
1-3 |
p. 191-206 16 p. |
article |
19 |
Preface
|
Hertz, Alain |
|
1996 |
65 |
1-3 |
p. 1-3 3 p. |
article |
20 |
Reverse search for enumeration
|
Avis, David |
|
1996 |
65 |
1-3 |
p. 21-46 26 p. |
article |
21 |
Shortest shortest path trees of a network
|
Hansen, Pierre |
|
1996 |
65 |
1-3 |
p. 275-284 10 p. |
article |
22 |
Some properties of non-bicolorable hypergraphs and the four-color problem
|
Berge, Claude |
|
1996 |
65 |
1-3 |
p. 73-79 7 p. |
article |
23 |
The simulated trading heuristic for solving vehicle routing problems
|
Bachem, A. |
|
1996 |
65 |
1-3 |
p. 47-72 26 p. |
article |
24 |
Three-dimensional axial assignment problems with decomposable cost coefficients
|
Burkard, Rainer E. |
|
1996 |
65 |
1-3 |
p. 123-139 17 p. |
article |
25 |
Time-tables, polyhedra and the greedy algorithm
|
Euler, R. |
|
1996 |
65 |
1-3 |
p. 207-221 15 p. |
article |