Efficient interactive methods for a class of multiattribute shortest path problems

Mordechai I. Henig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

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. Consequently, an interactive programming method is suggested which assesses the value function while using the principle of optimality to efficiently search for an optimal path.

Original languageEnglish
Pages (from-to)891-897
Number of pages7
JournalManagement Science
Volume40
Issue number7
DOIs
StatePublished - 1994

Fingerprint

Dive into the research topics of 'Efficient interactive methods for a class of multiattribute shortest path problems'. Together they form a unique fingerprint.

Cite this