Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Ninth Asia-Pacific Software Engineering Conference (APSEC'02)   p. 167
A Software Engineering Approach to Constraint Programming Systems

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/APSEC.2002.1182986
Send link to a friend

Abstract
Constraint programming (CP) systems are useful for solving real-life combinatorial problems, such as scheduling, planning, rostering and routing problems. The design of modern CP systems has evolved from a monolithic to an open design in order to meet the increasing demand for application-specific customization. It is widely accepted that a CP system needs to balance various design factors such as efficiency versus customizability and flexibility versus maintenance. This paper captures our experience with using different software engineering approaches in the development of constraint programming systems. These approaches allow us to systematically investigate the different factors that affect the performance of a CP system. In particular, we review the application of reuse techniques, such as toolkits, framework and patterns, to the design and implementation of a finite-domain CP system.
Additional Information

Citation:  Ka Boon Kevin Ng, Chiu Wo Choi, Martin Henz, "A Software Engineering Approach to Constraint Programming Systems," apsec, p. 167,  Ninth Asia-Pacific Software Engineering Conference (APSEC'02),  2002

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback