Pages that link to "Item:Q3523080"
From MaRDI portal
The following pages link to An LP-Based Heuristic for Optimal Planning (Q3523080):
Displaying 9 items.
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Anytime heuristic search for partial satisfaction planning (Q835822) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- Optimal admissible composition of abstraction heuristics (Q991018) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning (Q3460384) (← links)
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning (Q4913755) (← links)