Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

DM
2000

103views more DM 2000»

Feasible edge colorings of trees with cardinality constraints

15 years 2 months ago

Feasible edge colorings of trees with cardinality constraints

Download www.gerad.ca

A variation of preemptive open shop scheduling corresponds to

Dominique de Werra, Alain Hertz, Daniel Kobler, Na

Real-time Traffic

Bipartite Multigraphs | DM 2000 | Feasible Edge | Preemptive Open Shop |

claim paper

Related Content

» Multicommodity Demand Flow in a Tree

» Graph Inference from a Walk for TRees of Bounded Degree 3 is NPComplete

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» Degree Bounded Network Design with Metric Costs

» Provisioning a virtual private network a network design problem for multicommodity flow

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DM
Authors	Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev

Comments (0)