On a Class of Routing and Scheduling Problems that are Soluble on Graphs
No abstract is available for this item.
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1991|
|Contact details of provider:|| Postal: Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213-3890|
Web page: http://www.tepper.cmu.edu/
|Order Information:||Web: http://student-3k.tepper.cmu.edu/gsiadoc/GSIA_WP.asp|
When requesting a correction, please mention this item's handle: RePEc:cmu:gsiawp:1991-28. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Steve Spear)
If references are entirely missing, you can add them using this form.