New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education

Constraint Programming and Large Scale Discrete Optimization
Edited by: Eugene C. Freuder and Richard J. Wallace, University of New Hampshire, Durham, NH
A co-publication of the AMS and DIMACS.
 SEARCH THIS BOOK:
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
2001; 175 pp; hardcover
Volume: 57
ISBN-10: 0-8218-2710-3
ISBN-13: 978-0-8218-2710-9
List Price: US$68 Member Price: US$54.40
Order Code: DIMACS/57

Constraint programming has become an important general approach for solving hard combinatorial problems that occur in a number of application domains, such as scheduling and configuration. This volume contains selected papers from the workshop on Constraint Programming and Large Scale Discrete Optimization held at DIMACS. It gives a sense of state-of-the-art research in this field, touching on many of the important issues that are emerging and giving an idea of the major current trends. Topics include new strategies for local search, multithreaded constraint programming, specialized constraints that enhance consistency processing, fuzzy representations, hybrid approaches involving both constraint programming and integer programming, and applications to scheduling problems in domains such as sports scheduling and satellite scheduling.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Graduate students and research mathematicians interested in numerical analysis.

• R. J. Wallace and E. C. Freuder -- Introduction to DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization
General methods
• A. Nareyek -- Using global constraints for local search
• C. Voudouris and E. Tsang -- Guided local search joins the elite in discrete optimisation
• F. Zabatta -- Multithreaded constraint programming: A hybrid approach
CP approaches to scheduling
• H. Meyer auf'm Hofe -- Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
• J. C. Pemberton and F. Galiber, III -- A constraint-based approach to satellite scheduling
• J.-C. Régin -- Minimization of the number of breaks in sports scheduling problems using constraint programming
• B. M. Smith, C. J. Layfield, and A. Wren -- A constraint programming pre-processor for a bus driver scheduling system
LSCO and software methodology
• C. Gervet -- Large scale combinatorial optimization: A methodological viewpoint