Golden, Bruce L., Raghavan, S., Wasil, Edward A. (Eds.)
2005, IX, 396 p.
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
THE NEXT WAVE IN COMPUTING, OPTIMIZATION, AND DECISION TECHNOLOGIES is divided into six sections. The first section contains two papers on network models. The second section focuses in integer and mixed integer programming. The third section contains papers in which heuristic search and metaheuristics are applied. Three papers using stochastic modeling comprise the fourth section. In the fifth section, the unifying theme is software and modeling. The sixth section contains four papers on classification, clustering, and ranking. Each article in the volume has been carefully reviewed and revised accordingly.
Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state-of-the-art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.
–On the Complexity of Delaying an Adversary’s Project –A Note on Eswaran and Tarjan’s Algorithm for the Strong Connectivity Augmentation Problem –Generating Set Partitioning Test Problems with Known Optimal Integer Solutions –Computational Aspects of Controlled Tabular Adjustment: Algorithm and Analysis –The SYMPHONY Callable Library for Mixed Integer Programming –Hybrid Graph Heuristics Within a Hyper-Heuristic Approach to Exam Timetabling Problems –Metaheuristics Comparison for the Minimum Labelling Spanning Tree Problem –A New Tabu Search Heuristic for the Site-Dependent Vehicle Routing Problem –A Heuristic Method to Solve the Size Assortment Problem –Heuristic Methods for Solving Euclidean Non-Uniform Steiner Tree Problems –Modeling and Solving a Selection and Assignment Problem –Solving the Time Dependent Traveling Salesman Problem –The Maximal Multiple-Representation Species Problem Solved Using Heuristic Concentration –Fast and Efficient Model-Based Clustering with the Ascent-EM Algorithm –Statistical Learning Theory in Equity Return Forecasting –Sample Path Derivatives for (s, S) Inventory Systems with Price Determination –Network and Graph Markup Language (NAGML): Data File Formats –Software Quality Assurance for Mathematical Modeling Systems –Model Development and Optimization with Mathematica –Verification of Business Process Designs Using MAPS –ALPS: A Framework for Implementing Parallel Tree Search Algorithms –Tabu Search Enhanced Markov Blanket Classifier for High Dimensional Data Sets –Dance Music Classification Using Inner Metric Analysis –Assessing Cluster Quality Using Multiple Measures: A Decision Tree Based Approach –Dispersion of Group Judgments.