Fixed and Changeable Hierarchical Problems in Multiple Obective Dynamic Programming
This paper describes problems arising in multiple objective discrete dynamic programming with single and group hierarchy of criteria. Computer implementation of numerical procedures are also shortly presented.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
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:||1996|
|Date of revision:|
|Contact details of provider:|| Postal: Canada; Universite Laval, Faculte des sciences de l'administration. Pavillon des sciences de l'administration. Universite laval, Quebec, Canada G1K 7P4|
Phone: (418) 656-2180
Web page: http://www.fsa.ulaval.ca/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:lavadm:96-55. 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: (Thomas Krichel)
If references are entirely missing, you can add them using this form.