Inhaltsangabe-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.

Hersteller:
Springer Verlag GmbH
juergen.hartmann@springer.com
Tiergartenstr. 17
DE 69121 Heidelberg

Leseprobe

From the contents: 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.