A meta-heuristic for subset problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1990, Issue , 2001, Pages 274-287

  Flener, Pierre ^a   Hnich, Brahim ^a   Kızıltan, Zeynep ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTRAINT SOLVERS; EMPIRICAL STUDIES; METAHEURISTIC; NP COMPLETE; PROPAGATION ALGORITHM; RUNTIMES;

HEURISTIC ALGORITHMS;

EID: 84949197172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45241-9_19     Document Type: Conference Paper

References (19)

1. J.E. Borrett, E.P.K. Tsang, and N.R. Walsh. Adaptive constraint satisfaction: The quickest-first principle. In Proc. of ECAI’96, pp. 160–164. JohnWiley & Sons, 1996.
2. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In: H. Glaser, P. Hartel, and H. Kuchen (eds), Proc. of PLILP’97, pp. 191–206. LNCS 1292. Springer-Verlag, 1997.
3. T. Ellman, J. Keane, A. Banerjee, and G. Armhold. A transformation system for interactive reformulation of design optimization strategies. Research in Engineering Design 10(1):30–61, 1998.
4. P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. In Proc of ASE’98, pp. 168–176. IEEE Computer Society Press, 1998.
5. P. Flener, B. Hnich, and Z. Kızıltan. Towards schema-guided compilation of set constraint programs. In B. Jayaraman and G. Rossi (eds), Proc of DPS’99, pp. 59–66. Tech. Rep. 200, Math. Dept., Univ. of Parma, Italy, 1999.
6. P. Flener, B. Hnich, and Z. Kızıltan. Compiling high-level type constructors in constraint programming. In: I.V. Ramakrishnan (ed), Proc of PADL’01. LNCS, this volume. Springer-Verlag, 2001.
7. P.A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In Proc of ECAI’92, pp. 31–35. John Wiley & Sons, 1992.
8. C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3):191–244, 1997.
9. J.M. Gratch and S.A. Chien. Adaptive problem-solving for large scale scheduling problems: A case study. J. of Artificial Intelligence Research 4:365–396, 1996.
10. B. Hnich and Z. Kızıltan. Generating programs for k-subset problems. In P. Alexander (ed), Proc of the ASE’99 Doctoral Symposium. 1999.
11. B. Hnich, Z. Kiziltan, and P. Flener. A meta-heuristic for subset decision problems. In:K.R. Apt, E. Monfroy, and F. Rossi (eds), Proc. of the 2000 ERCIM/CompuLog Workshop on Constraint Programming. 2000.
12. Z. Kızıltan, P. Flener, and B. Hnich. A labelling heuristic for subset problems. Submitted for review. Available via http://www.dis.uu.se/∼pierref/astra/.
13. Z. Kızıltan and P. Flener. An adaptive meta-heuristic for subset problems. Submitted for review. Available via http://www.dis.uu.se/∼pierref/astra/.
14. S. Minton. Automatically configuring constraint satisfaction programs: A case study. Constraints 1(1–2):7–43, 1996.
15. T. Müller. Solving set partitioning problems with constraint programming. In Proc of PAPPACT’98, pp. 313–332. The Practical Application Company, 1998.
16. E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
17. E.P.K. Tsang, J.E. Borrett, and A.C.M. Kwan. An attempt to map the performance of a range of algorithm and heuristic combinations. In Proc. of AISB’95, pp. 203–216. IOS Press, 1995.
18. P. Van Hentenryck. The opl Optimization Programming Language. The MIT Press, 1999.
19. C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence 70:73–117, 1994.