Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 124, Number 1, 15 December 2002
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

Editors nr. 1
pp. v-vi

Vertex characterization of partition polytopes of bipartitions and of planar point sets
pp. 1-15(15)
Authors: Aviran S.; Lev-Tov N.; Onn S.; Rothblum U.G.

On the number of vertices belonging to all maximum stable sets of a graph
pp. 17-25(9)
Authors: Boros E.; C. Golumbic M.; E. Levit V.

On the facets of the simple plant location packing polytope
pp. 27-53(27)
Authors: Canovas L.; Landete M.; Marn A.

Bounds for probabilistic integer programming problems
pp. 55-65(11)
Authors: Dentcheva D.; Ruszczynski A.

Block duplicate graphs and a hierarchy of chordal graphs
pp. 67-71(5)
Authors: Golumbic M.C.; Peled U.N.

Camel sequences and quadratic residues
pp. 73-89(17)
Authors: Gurvich V.A.; Sheng L.

A new Greedoid: the family of local maximum stable sets of a forest
pp. 91-101(11)
Authors: Levit V.E.; Mandrescu E.

Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach
pp. 103-116(14)
Authors: Maia de Abreu N.M.; Netto P.O.B.; Querido T.M.; Gouvea E.F.

Finding the Pareto-optima for the total and maximum tardiness single machine problem
pp. 117-126(10)
Authors: Tadei R.; Grosso A.; Della Croce F.

A family of restricted subadditive recursions
pp. 127-139(13)
Author: Wallace R.J.

Author index
pp. 141-141(1)

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A