A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning

MaRDI QIDQ5283009zbMATH OpenFDO

Authors Tatsuya Imai, Alex Fukunaga

Publication date 18 July 2017

Full work available at URL http://ebooks.iospress.nl/volumearticle/36983

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10)

Recommendations

• On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
• An LP-Based Heuristic for Optimal Planning
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Solving delete free planning with relaxed decision diagram based heuristics
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization

Cited in

(3)

• On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
• An LP-Based Heuristic for Optimal Planning
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization

This page was built for publication: A practical, integer-linear programming model for the delete-relaxation in cost-optimal planning

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