Volume 134, Number 1-3, 5 January 2004
- Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Open shop scheduling problems with late work criteria.
1-24
- Nadia Brauner, Yves Crama:
The maximum deviation just-in-time scheduling problem.
25-50
- Roberto Cordone, Francesco Maffioli:
On the complexity of graph tree partition problems.
51-65
- Daniel Granot, Herbert Hamers:
On the equivalence between some local and global Chinese postman and traveling salesman graphs.
67-76
- Elena Grigorescu:
The insulation sequence of a graph.
77-90
- Raj Jagannathan:
On polynomial complexity of a stochastic algorithm for mixed zero-one programs.
91-103
- Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
Algorithms for graphs with small octopus.
105-128
- Armen S. Asratian, Nikolai N. Kuzjurin:
Two sensitivity theorems in fuzzy integer programming.
129-140
- Renata Mansini, Maria Grazia Speranza, Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors.
141-168
- Kampei Miyakawa, Hiroshi Narushima:
Lattice-theoretic properties of MPR-posets in phylogeny.
169-192
- Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini:
Lift and project relaxations for the matching and related polytopes.
193-212
- Asa Packer:
Polynomial-time approximation of largest simplices in V-polytopes.
213-237
- Natasa Przulj, Derek G. Corneil, Ekkehard Köhler:
Hereditary dominating pair graphs.
239-261
- Joachim Rosenmüller, Peter Sudhölter:
Cartels via the modiclus.
263-302
- Akiyoshi Shioura:
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
303-316
- Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi:
A characterization of Thompson digraphs.
317-337
- Heping Zhang, Rijun Zha, Haiyuan Yao:
Z-transformation graphs of maximum matchings of plane bipartite graphs.
339-350
- Craig A. Tovey:
Non-approximability of precedence-constrained sequencing to minimize setups.
351-360
Last update Sat May 18 20:20:30 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
