Constraint Programming and Large Scale Discrete Optimization
Regular price
€78.99
14 days return policy
Shipping & Delivery
A01=American Mathematical Society
Author_American Mathematical Society
Category=PBU
Category=PBW
Category=UM
Category=UYA
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Product details
- ISBN 9780821827109
- Weight: 567g
- Publication Date: 28 Feb 2001
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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. The 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.
