Discrete Applied Mathematics 1997: Vol 76 Table of Contents

2 Pages·1997·0.29 MB·English

DISCRETE APPLIED MATHEMATICS
Volume 76, Numbers 1-3, 13 June 1997
Special Volume
Second International Colloquium on Graphs and Optimization
Abstracted/Indexed in: ACM Computing Reviews, Cambridge Scientific
Abstracts, Current Contents: Physical, Chemical & Earth Sciences, Engineering
Index/Compendex, INSPEC Information Services, International Abstracts in
Operations Research, Mathematical Reviews, PASCAL, Science Citation Index,
Statistical Theory and Method Abstracts, Zentralblatt fur Mathematik.
Contents
Preface
P. Bertolazzi, C.D e Simone and A. Galluccio
A nice class for the vertex packing problem
J. Blazewicz and M. Drozdowski
Distributed processing of divisible jobs with communication
startup costs
P. Brucker, J. Hurink, B. Jurisch and B. Wostmann
A branch & bound algorithm for the open-shop problem
J. Carlier, Y. Li and J.-l. Lutton
Reliability evaluation of large telecommunication networks
M. Cochand, A. Gaillard and H. Groflin
Optimum partitioning into intersections of ring families
D. de Werra and N.V.R. Mahadev
Preassignment requirements in chromatic scheduling
M. Dell’ Amico and S. Martello
The k-cardinality assignment problem
G. Finke and H. Jiang
A variant of the permutation flow shop model with variable
processing times
A. Gaillard
Switchdec polyhedra
E. Pesch and F. Glover
TSP ejection chains
A. Hertz
On the use of Boolean methods for the computation of the stability
number
A.J.W. Hilton and C. Zhao
Vertex-splitting and chromatic index critical graphs
M. Kubale
Open shop problem with zero—one time operations and integer
release date/deadline intervals
N.V.R. Mahadev and F.S. Roberts
Amenable colorings
M. Queyranne and F.C.R. Spieksma
Approximation algorithms for multi-index transportation problems
with decomposable costs
Author Index