Volume 124,
Number 1-3,
December 2002
- Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
1-15
- Endre Boros, Martin Charles Golumbic, Vadim E. Levit:
On the number of vertices belonging to all maximum stable sets of a graph.
17-25
- Lázaro Cánovas, Mercedes Landete, Alfredo Marín:
On the facets of the simple plant location packing polytope.
27-53
- Darinka Dentcheva, András Prékopa, Andrzej Ruszczynski:
Bounds for probabilistic integer programming problems.
55-65
- Martin Charles Golumbic, Uri N. Peled:
Block duplicate graphs and a hierarchy of chordal graphs.
67-71
- V. A. Gurvich, Li Sheng:
Camel sequences and quadratic residues.
73-89
- Vadim E. Levit, Eugen Mandrescu:
A new Greedoid: the family of local maximum stable sets of a forest.
91-101
- Nair Maria Maia de Abreu, Paulo Oswaldo Boaventura Netto, Tania Maia Querido, Elizabeth Ferreira Gouvea:
Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach.
103-116
- Roberto Tadei, Andrea Grosso, Federico Della Croce:
Finding the Pareto-optima for the total and maximum tardiness single machine problem.
117-126
- Roger J. Wallace:
A family of restricted subadditive recursion.
127-139
Copyright © Tue Dec 22 22:01:07 2009
by Michael Ley (ley@uni-trier.de)
