Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search

DOI10.3233/AIC-160704zbMATH Open1373.68204DBLPjournals/aicom/LippiEF15WikidataQ62695759 ScholiaQ62695759MaRDI QIDQ4589262FDOQ4589262

Ariel Felner, Marco Lippi, Marco Ernandes

Publication date: 10 November 2017

Published in: AI Communications (Search for Journal in Brave)

Recommendations

• Two new bidirectional search algorithms
• Relative-order abstractions for the pancake problem
• Block sorting: a characterization and some heuristics
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• On the problem of sorting burnt pancakes

zbMATH Keywords

heuristic searchbidirectional searchpermutation sorting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10)

Cited In (5)

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• A heuristic to accelerate in-situ permutation algorithms
• Duality in permutation state spaces and the dual search algorithm
• Sorting with forbidden intermediates
• Optimal path discovery problem with homogeneous knowledge

This page was built for publication: Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589262)