Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$224.58
Used and New from Other Sellers
Used and New from Other Sellers
from $24.00
Usually ships in 1-2 business days
(Save 91%)
Other sellers (Hardcover)
  • All (4) from $24.00   
  • New (2) from $214.45   
  • Used (2) from $24.00   

Overview

Computer Science and Operations Research continue to have a synergistic relationship and this book - as a part of the Operations Research and Computer Science Interface Series - sits squarely in the center of the confluence of these two technical research communities. The research presented in the volume is evidence of the expanding frontiers of these two intersecting disciplines and provides researchers and practitioners with new work in the areas of logic programming, shastic optimization, heuristic search and post-solution analysis for integer programs.
The chapter topics span the spectrum of application level. Some of the chapters are highly applied and others represent work in which the application potential is only beginning. In addition, each chapter contains expository material and reviews of the literature designed to enhance the participation of the reader in this expanding interface.
Read More Show Less

Product Details

Table of Contents

Preface. 1. Constraint Satisfaction Methods; J.N. Hooker. 2. Extending a General-Purpose Algebraic Modeling Language to Combinatorial Optimization: A Logic Programming Approach; R. Fourer. 3. Disjunctive Programming and Cooperating Solvers; K. McAloon, et al. 4. Mixed and Integer Programming Post-Solution Analysis; H.J. Greenberg. 5. Shastic Knapsack Problem; D.P. Morton, R.K. Wood. 6. Sample-Path Solutions for Simulation Optimization Problems and Shastic Variational Inequalities; G. Gürkan, et al. 7. Play Selection in American Football: A Case Study in Neuro-Dynamic Programming; S.D. Patek, D.P. Bertsekas. 8. Tabu Search Candidate List Strategies in Scheduling; B. Rangaswamy, et al. 9. GA's and Surrogate Constraints for MCKPs; C. Haul, S. Voß. 10. Introduction to Genetic Heuristics and Vehicle Routing Problems with Complex Constraints; S.R. Thangiah, P. Petrovic. 11. A Genetic Algorithm for the Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters; J.-Y. Potvin, F. Guertin. 12. A New Algorithm for the Site-Dependent Vehicle Routing Problem; I-Ming Chao, et al.
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)