Heuristic search strategies for multiobjective state space search
From MaRDI portal
Publication:5955789
DOI10.1007/BF02745524zbMath1009.68524OpenAlexW2045256528MaRDI QIDQ5955789
Partha Pratim Chakrabarti, S. C. de Sarkar, Pallab Dasgupta
Publication date: 18 February 2002
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02745524
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-space best-first search
- A heuristic search algorithm with modifiable estimate
- Interactive weight assessment in multiple attribute decision making
- Depth-first iterative-deepening: An optimal admissible tree search
- A hierarchical interactive method for ranking alternatives with multiple qualitative criteria
- On the problem of weights in multiple criteria decision making (the noncompensatory approach)
- The interface with decision makers and some experimental results in interactive multiple objective programming methods
- General communication schemes for multiobjective decision making
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Effective use of memory in iterative deepening search
- On the complexity of admissible search algorithms
- On the optimality of A
- Heuristic search in restricted memory
- Generalized best-first search strategies and the optimality of A*
- Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
- Multiobjective A*
- A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems
This page was built for publication: Heuristic search strategies for multiobjective state space search
