| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A branch and bound algorithm for the job-shop scheduling problem
|
Brucker, Peter
|
|
1994
|
49 |
1-3 |
p. 107-127
21 p.
|
article
|
| 2 |
A guide to the graph labeling zoo
|
Gallian, Joseph A.
|
|
1994
|
49 |
1-3 |
p. 213-229
17 p.
|
article
|
| 3 |
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
|
Sherali, Hanif D.
|
|
1994
|
49 |
1-3 |
p. 357-378
22 p.
|
article
|
| 4 |
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
|
Freville, Arnaud
|
|
1994
|
49 |
1-3 |
p. 189-212
24 p.
|
article
|
| 5 |
An exact algorithm for the 0–1 collapsing knapsack problem
|
Fayard, Didier
|
|
1994
|
49 |
1-3 |
p. 175-187
13 p.
|
article
|
| 6 |
An O(nm)-time algorithm for computing the dual of a regular Boolean function
|
Peled, Uri N.
|
|
1994
|
49 |
1-3 |
p. 309-323
15 p.
|
article
|
| 7 |
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
|
Bandelt, Hans-Jürgen
|
|
1994
|
49 |
1-3 |
p. 25-50
26 p.
|
article
|
| 8 |
Author index
|
|
|
1994
|
49 |
1-3 |
p. 379-380
2 p.
|
article
|
| 9 |
Balancing problems in acyclic networks
|
Boros, Endre
|
|
1994
|
49 |
1-3 |
p. 77-93
17 p.
|
article
|
| 10 |
Chromatic scheduling and frequency assignment
|
de Werra, D.
|
|
1994
|
49 |
1-3 |
p. 165-174
10 p.
|
article
|
| 11 |
Decompositions into linear forests and difference labelings of graphs
|
Bloom, Gary S.
|
|
1994
|
49 |
1-3 |
p. 61-75
15 p.
|
article
|
| 12 |
Editorial Board
|
|
|
1994
|
49 |
1-3 |
p. iii-iv
nvt p.
|
article
|
| 13 |
Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
|
Bahn, O.
|
|
1994
|
49 |
1-3 |
p. 3-23
21 p.
|
article
|
| 14 |
Local optima topology for the k-coloring problem
|
Hertz, Alain
|
|
1994
|
49 |
1-3 |
p. 257-280
24 p.
|
article
|
| 15 |
Medians for weight metrics in the covering graphs of semilattices
|
Leclerc, Bruno
|
|
1994
|
49 |
1-3 |
p. 281-297
17 p.
|
article
|
| 16 |
On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
|
Roberts, Fred S.
|
|
1994
|
49 |
1-3 |
p. 331-356
26 p.
|
article
|
| 17 |
Preface
|
Hertz, A.
|
|
1994
|
49 |
1-3 |
p. 1-2
2 p.
|
article
|
| 18 |
Probabilistic estimates for the generalized maximum satisfiability problem
|
Cochand, M.
|
|
1994
|
49 |
1-3 |
p. 143-163
21 p.
|
article
|
| 19 |
Solving the uncapacited plant location problem on trees
|
Billionnet, Alain
|
|
1994
|
49 |
1-3 |
p. 51-59
9 p.
|
article
|
| 20 |
Some complexity results about threshold graphs
|
Margot, F.
|
|
1994
|
49 |
1-3 |
p. 299-308
10 p.
|
article
|
| 21 |
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
|
Glover, Fred
|
|
1994
|
49 |
1-3 |
p. 231-255
25 p.
|
article
|
| 22 |
The complexity of colouring symmetric relational systems
|
Brewster, Richard
|
|
1994
|
49 |
1-3 |
p. 95-105
11 p.
|
article
|
| 23 |
Total matchings and total coverings of threshold graphs
|
Peled, Uri
|
|
1994
|
49 |
1-3 |
p. 325-330
6 p.
|
article
|
| 24 |
Tree scheduling with communication delays
|
Chretienne, Philippe
|
|
1994
|
49 |
1-3 |
p. 129-141
13 p.
|
article
|
Journal description