Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Home > Mathematics and Science Textbooks > Mathematics > Calculus and mathematical analysis > Numerical analysis > Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)


     0     
5
4
3
2
1



Available


X
About the Book

This book constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009. The 20 revised full papers and 10 extended abstracts presented together with 2 invited talks were carefully reviewed and selected from 65 submissions. The papers describe current research in the fields of constraint programming, artificial intelligence, and operations research and present new techniques or new applications in combinatorial optimization, thus exploring ways of solving large-scale, practical optimization problems through integration and hybridization of the fields' different techniques.

Table of Contents:
Invited Talks.- Machine Learning Framework for Classification in Medicine and Biology.- G12 - Towards the Separation of Problem Modelling and Problem Solving.- Regular Papers.- Six Ways of Integrating Symmetries within Non-overlapping Constraints.- Throughput Constraint for Synchronous Data Flow Graphs.- A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem.- Backdoors to Combinatorial Optimization: Feasibility and Optimality.- Solution Enumeration for Projected Boolean Search Problems.- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.- Optimal Interdiction of Unreactive Markovian Evaders.- Using Model Counting to Find Optimal Distinguishing Tests.- Reformulating Global Grammar Constraints.- IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems.- Open Constraints in a Boundable World.- Sequencing and Counting with the multicost-regular Constraint.- Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services.- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming.- The Polytope of Context-Free Grammar Constraints.- Determining the Number of Games Needed to Guarantee an NHL Playoff Spot.- Scalable Load Balancing in Nurse to Patient Assignment Problems.- Learning How to Propagate Using Random Probing.- DFS* and the Traveling Tournament Problem.- Max Energy Filtering Algorithm for Discrete Cumulative Resources.- Extended Abstracts.- Hybrid Branching.- Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.- Constraint Models for Sequential Planning.- A Fast Algorithm to Solve the Frequency Assignment Problem.- A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem.- Modelling Search Strategies in Rules2CP.- CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications.- An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays.- A Benders’Approach to a Transportation Network Design Problem.- Progress on the Progressive Party Problem.


Best Sellers


Product Details
  • ISBN-13: 9783642019289
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 332
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Width: 155 mm
  • ISBN-10: 3642019285
  • Publisher Date: 06 May 2009
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 5547 Lecture Notes in Computer Science
  • Sub Title: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings(Theoretical Computer Science and General Issues)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!