|
![]() |
|||
|
||||
OverviewThe research presented in this volume is evidence of the expanding frontiers of two intersecting disciplines - computer science and operations research. It provides researchers and practitioners with work in the areas of logic programming, stochastic optimization, heuristic search and post-solution analysis for integer programs. The topics covered 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. Full Product DetailsAuthor: David L. WoodruffPublisher: Springer Imprint: Springer Edition: 1998 ed. Volume: 9 Dimensions: Width: 15.50cm , Height: 1.90cm , Length: 23.50cm Weight: 1.390kg ISBN: 9780792380788ISBN 10: 0792380789 Pages: 312 Publication Date: 31 December 1997 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1 Constraint Satisfaction Methods.- 2 Extending a General-Purpose Algebraic Modeling Language to Combinatorial Optimization: A Logic Programming Approach.- 3 Disjunctive Programming and Cooperating Solvers.- 4 An Annotated Bibliography for Post-solution Analysis in Mixed Integer Programming and Combinatorial Optimization.- 5 Stochastic Knapsack Problem.- 6 Sample-Path Solutions for Simulation Optimization Problems and Stochastic Variational Inequalities.- 7 Play Selection in American Football: a Case Study in Neuro-Dynamic Programming.- 8 Tabu Search Candidate List Strategies in Scheduling.- 9 GA’s and Surrogate Constraints for MCKPs.- 10 Introduction to Genetic Heuristics and Vehicle Routing Problems with Complex Constraints.- 11 A Genetic Algorithm for the Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters.- 12 A New Algorithm for the Site-Dependent Vehicle Routing Problem.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |