Integer programs and valid inequalities for planning problems

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 239-251

  Bockmayr, Alexander ^a   Dimopoulos, Yannis ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

CAPACITY CONSTRAINTS; COMBINATORIAL SEARCH; HEURISTIC SEARCH METHODS; LINEAR PROGRAMMING RELAXATION; NUMERICAL CONSTRAINTS; OBJECTIVE FUNCTIONS; PROPOSITIONAL LOGIC; REPRESENTATION LANGUAGES;

INTEGER PROGRAMMING;

EID: 0005042209     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_19     Document Type: Conference Paper

References (21)

1. P.Barth.Logic-based 0-1 constraint programming.Operations Research/ Computer Science Interfaces Series.Kluwer, 1996.http://www.mpi-sb.mpg.de/-barth/opbdp/opbdp.html
2. P.Barth and A.Bockmayr.Modelling discrete optimisation problems in constraint logic programming.Annals of Operations Research, 81:467-496, 1998.
3. Blum A.And Furst M.Fast planning through planning graph analysis, Artificial Intelligence, 90, 281-300, 1997.
4. A.Bockmayr.Solving pseudo-Boolean constraints.In Constraint Programming: Basics and Trends, 22-38.Springer, LNCS 910, 1995.
5. A.Bockmayr and Y.Dimopoulos.Mixed integer programming models for planning problems.In CP'98 Workshop on Constraint Problem Reformulation, 1998.
6. B.Bonet, G.Loerincs, H.Gener.A fast and robust action selection mechanism for planning.AAAI'97.
7. T.Bylander.A Linear Programming Heuristic for Optimal Planning.AAAI'97.
8. CPLEX Optimization, Inc.Using the CPLEX callable library, 1995.http://www.cplex.com
9. A.Gerevini and L.Schubert.Accelerating Partial-Order Planners: Some Techni-ques for eective Search Control and Pruning.Journal of Artificial Intelligence Research, Vol.5, 1996.
10. Y-C.Huang, B.Selman and H.Kautz.Control Knowledge in Planning: Benets and Tradeofis.IJCAI'99.
11. H.Kautz and B.Selman.Pushing the envelope: planning, propositional logic and stochastic search.AAAI'96.
12. H.Kautz and B.Selman.The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework.AIPS'98.
13. H.Kautz and B.Selman.Unifying SAT-based and Graph-based Planning.IJ-CAI'99.
14. H.Kautz and J.Walser.State-Space Planning by Integer Optimization.AAAI'99.
15. J.Koehler.Planning under Resource Constraints.ECAI'98.
16. J.Koehler, B.Nebel, J.Homann and Y.Dimopoulos.Extending Planning Graphs to an ADL Subset.4th European Conference on Planning, ECP'97.
17. D.McDermott.A heuristic estimator for means-ends analysis in planning.AIPS'96.
18. G.L.Nemhauser and L.A.Wolsey.Integer and Combinatorial Optimization.Wiley, 1988.
19. P.van Beek and X.Chen.CPlan: A Constraint Programming Approach to Plan-ning.AAAI'99.
20. T.Vossen, M.Ball, A.Lotem and D.Nau.On the Use of Integer Programming Models in AI Planning.IJCAI'99.
21. S.Wolfman and D.Weld.The LPSAT Engine and its Application to Resource Planning, IJCAI'99.