-10%
159,95 €
Statt 177,95 €**
159,95 €
inkl. MwSt.
**Früherer Preis
Sofort per Download lieferbar
Versandkostenfrei*
80 °P sammeln
-10%
159,95 €
Statt 177,95 €**
159,95 €
inkl. MwSt.
**Früherer Preis
Sofort per Download lieferbar
Versandkostenfrei*

Alle Infos zum eBook verschenken
80 °P sammeln
Als Download kaufen
Statt 177,95 €**
-10%
159,95 €
inkl. MwSt.
**Früherer Preis
Sofort per Download lieferbar
80 °P sammeln
Jetzt verschenken
Statt 177,95 €**
-10%
159,95 €
inkl. MwSt.
**Früherer Preis
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
80 °P sammeln
  • Format: PDF


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. TOC:From the contents: On the Complexity of Delaying an Adversary's Project.- A Note on Eswaran and Tarjan's…mehr

  • Geräte: PC
  • ohne Kopierschutz
  • eBook Hilfe
  • Größe: 21.69MB
Produktbeschreibung
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. TOC: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.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

  • Produktdetails
  • Verlag: Springer-Verlag GmbH
  • Erscheinungstermin: 13.10.2006
  • Englisch
  • ISBN-13: 9780387235295
  • Artikelnr.: 37286230
Autorenporträt
Bruce L. Golden, University of Maryland, College Park, MD, USA / S. Raghavan, University of Maryland, College Park, MD, USA / Edward A. Wasil, American University, Washington, DC, USA
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.