Operations research knapsack problem (1 Ergebnisse)
- Weitere Bilder
- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 37,54
EUR 61,73 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Source: Wikipedia. Pages: 171. Chapters: Knapsack problem, Travelling salesman problem, Queueing theory, Optimization, Linear programming, Mathematical model, Dynamic programming, Genetic programming, Simulation, Strategic Bombing Survey,…System dynamics, Optimal design, Analytic Hierarchy Process, Potentially all pairwise rankings of all possible alternatives, Simplex algorithm, Inventory, Metaheuristic, Scheduling, Purchasing, Divide and conquer algorithm, Hyper-heuristic, Semidefinite programming, Cutting stock problem, Backtracking, General Algebraic Modeling System, Data envelopment analysis, Geometric median, Institute for Operations Research and the Management Sciences, Analytic network process, Differential evolution, Flow network, Preference Ranking Organization Method for Enrichment Evaluation, Canadian traveller problem, Industrial engineering, Jeep problem, Response surface methodology, Critical path method, DYNAMO, Nelder Mead method, Event chain methodology, Decision analysis, COIN-OR, Energy minimization, Ellipsoid method, Multi-criteria decision analysis, Leverage Point Modeling, System archetype, MPS, AMPL, Job shop scheduling, Bayesian experimental design, Military Operations Research Society, Fixes that fail, Economic order quantity, Linear-fractional programming, Plan, Goal programming, Ariadne's thread, United States Army Training and Doctrine Command Analysis Center, Stochastic programming, Paradiseo, Standard Boolean model, Simulation Interoperability Standards Organization, Shadow price, Economic production quantity, Genetic algorithm scheduling, Uncertainty quantification, Generalized assignment problem, Mathematical Programming Society, Facility location, Vehicle routing problem, Safe sex makespan, Little's law, Newsvendor, Multiscale decision making, Economic Lot Scheduling Problem, Evidential reasoning approach, Event chain diagram, WalkSAT, OpenOpt, Algorithm engineering, Monge array, Job-shop problem, Dynamic simulation, MOSEK, Johnson's Rule, Franz Edelman Award for Achievement in Operations Research and the Management Sciences, Linear scheduling method, FuncDesigner, OpenEaagles, Algebraic modeling language, Supnick matrix, Pollaczek Khinchine formula, Bondareva Shapley theorem, Advanced Analytics, SCIP, Behavioral operations research, Algorithm design, K-medians clustering, OptimJ, Silver-Meal heuristic, Participatory modeling, Optimal maintenance, Big M method, Hilbert basis, Least cost planning methodology, Transportation Science, Inventory theory, Nl, Operations and technology management, 1-center problem, Dynamic lot size model, Carrying cost, Lawler s Algorithm, Interservice/Industry Training, Simulation and Education Conference, Management Science: A Journal of the Institute for Operations Research and the Management Sciences, Peace gaming, Sequence-dependent setup, Operations Research Society of South Africa, Inventory control, Industrial engineering and operations research, International Federation of Operational Research Societies, Health systems engineering, Set TSP problem, Mathematics of Operations Research, Integer programming, Extended Newsvendor models, Theory of two-level planning, Interdisciplinary Center for Organizational Architecture, Management engineering, The Operational Research Society, Mining simulator, Linear programming decoding, Government Operational Research Service, Open Shop Scheduling, Criticality matrix, Master of Management in Operations Research. Excerpt: Simulation i.
