Discrete Applied Mathematics 2004: Vol 134 Table of Contents PDF
Preview Discrete Applied Mathematics 2004: Vol 134 Table of Contents
Discrete Applied Mathematics Volume 134, Numbers 1-3, 5 January 2004 Contents Contributions J. Btazewicz, E. Pesch, M. Sterna and F. Werner Open shop scheduling problems with late work criteria N. Brauner and Y. Crama The maximum deviation just-in-time scheduling problem R. Cordone and F. Maoli On the complexity of graph tree partition problems D. Granot and H. Hamers On the equivalence between some local and global Chinese postman and traveling salesman graphs E. Grigorescu The insulation sequence of a graph R. Jagannathan On polynomial complexity of a stochastic algorithm for mixed zero-one programs F.V. Fomin, D. Kratsch and H. Miller Algorithms for graphs with small octopus A.S. Asratian and N.N. Kuzjurin Two sensitivity theorems in fuzzy integer programming R. Mansini, M. Grazia Speranza and Z. Tuza Scheduling groups of tasks with precedence constraints on three dedicated processors K. Miyakawa and H. Narushima Lattice-theoretic properties of MPR-posets in phylogeny N.E. Aguilera, S.M. Bianchi and G.L. Nasini Lift and project relaxations for the matching and related polytopes doi: 10.1016/S0166-218X(03)00620-6 A. Packer Polynomial-time approximation of largest simplices in V-polytopes N. Prulj, D.G. Corneil and E. Kohler Hereditary dominating pair graphs J. Rosenmiller and P. Sudhdlter Cartels via the modiclus A. Shioura Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem D. Giammarresi, J.-L. Ponty, D. Wood and D. Ziadi A characterization of Thompson digraphs H. Zhang, R. Zha and H. Yao Z-transformation graphs of maximum matchings of plane bipartite graphs Notes C.A. Tovey Non-approximability of precedence-constrained sequencing to minimize setups Author index to volume 134 Guide for authors CONTENTS _ This journal is part of ContentsDirect, the free alerting service which sends table of contents by e-mail for Elsevier books & and journals. You can register for ContentsDirect online at: http://contentsdirect.elsevier.com
The list of books you might like
