Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures, routing and layout, sorting and searching; G.2.1 [Discrete Mathematics]: Combinatorics -- combinatorial algorithms; G.2.2 [Discrete Mathematics]: Graph Theory -- graph algorithms, network problems, path and dynamic programming, graph and tree search strategies, heuristic methods
General Terms: Theory
Additional Key Words and Phrases: $A*$ multiobjective decisionmaking
Selected papers that cite this one
- Pallab Dasgupta, P. P. Chakrabarti, and S. C. DeSarkar. Utility of pathmax in partial order heuristic search. Information Processing Letters, 55(6):317-322, 29 September 1995.
- Pallab Dasgupta, P. P. Chakrabarti, and S. C. DeSarkar. Multiobjective heuristic search in AND/OR graphs. Journal of Algorithms, 20(2):282-311, March 1996.
- S. Harikumar and Shashi Kumar. Iterative deepending multiobjective A*. Information Processing Letters, 58(1):11-15, 8 April 1996.