Anytime pack search
From MaRDI portal
Publication:2311238
DOI10.1007/s11047-015-9490-9zbMath1415.68208OpenAlexW2081598683MaRDI QIDQ2311238
Satya Gautam Vadlamudi, Sandip Aine, Partha Pratim Chakrabarti
Publication date: 10 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-015-9490-9
Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ Anytime pack search ⋮ Anytime algorithms for the longest common palindromic subsequence problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel depth first search. I: Implementation
- Parallel depth first search. II: Analysis
- Single machine earliness and tardiness scheduling
- Job shop scheduling with beam search
- Anytime pack search
- Incremental beam search
- Heuristic search viewed as path finding in a graph
- Learning Optimal Bayesian Networks: A Shortest Path Perspective
- Best-First Heuristic Search for Multicore Machines
- Three approaches to heuristic search in networks
- TSPLIB—A Traveling Salesman Problem Library
- Interval Heaps
- An application of heuristic search methods to edge and contour detection
- Optimizing decision trees through heuristically guided search
- Branch-and-Bound Methods: A Survey
- Planning as heuristic search
- Disjoint pattern database heuristics
This page was built for publication: Anytime pack search
