Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/14434
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMordechai I. Henig-
dc.date.accessioned2024-03-02T06:27:45Z-
dc.date.available2024-03-02T06:27:45Z-
dc.date.issued1994-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/14434-
dc.description.abstractGiven an acyclic network and a preference-order relation on paths, when and how can Bellman's principle of optimality be combined with interactive programming to efficiently locate an optimal path? We show that if preferences are defined via a collection of attributes, then, under common conditions, the principle of optimality is valid if and only if the preferences can be represented by a linear (value) function over the attributes.-
dc.publisherJournal of the Institute of Management Sciences-
dc.subjectattributes-
dc.subjectinteractive programming.-
dc.titleEfficient Interactive Methods for a Class of Multiattribute Shortest Path Problems-
dc.volVol. 40-
dc.issuedNo. 7-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Efficient Interactive Methods.pdf
  Restricted Access
3.44 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.