English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Mixed Integer Programming Models for Planning Problems

MPS-Authors
/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44325

Dimopoulos,  Yannis
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bockmayr, A., & Dimopoulos, Y. (1998). Mixed Integer Programming Models for Planning Problems. In J. Frank, & M. Sabin (Eds.), Proceedings of the Workshop on Constraint Problem Reformulation (CP-98) (pp. 1-6). Moffett Field, USA: NASA Ames Research Center.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3856-5
Abstract
We present some preliminary work on modeling AI planning as a Mixed Integer Programming (MIP) problem. We discuss the main advantages and disadvantages of the approach and compare it to traditional planning frameworks. We investigate a number of MIP models of specific problems, each of them exploiting different strengths of the MIP formulation, and present our computational experience with these models.