Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/14434
Title: Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
Authors: Mordechai I. Henig
Keywords: attributes
interactive programming.
Issue Date: 1994
Publisher: Journal of the Institute of Management Sciences
Abstract: Given 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.
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/14434
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.