Algorithms and Model Formulations in Mathematical Programming: NATO ASI Subseries F:, cartea 51
Editat de Stein W. Wallaceen Limba Engleză Paperback – 30 mai 2012
Din seria NATO ASI Subseries F:
- 20%
Preț: 642.70 lei - 20%
Preț: 953.88 lei - 18%
Preț: 1190.96 lei - 20%
Preț: 1847.73 lei - 20%
Preț: 631.95 lei - 18%
Preț: 1185.98 lei - 20%
Preț: 682.34 lei - 20%
Preț: 630.68 lei - 18%
Preț: 1782.54 lei - 20%
Preț: 360.65 lei - 20%
Preț: 953.40 lei - 20%
Preț: 645.09 lei - 20%
Preț: 1850.75 lei - 20%
Preț: 956.09 lei -
Preț: 374.71 lei - 20%
Preț: 632.58 lei - 20%
Preț: 629.88 lei - 18%
Preț: 1177.62 lei - 18%
Preț: 915.13 lei - 20%
Preț: 319.42 lei - 20%
Preț: 1234.45 lei - 20%
Preț: 619.89 lei -
Preț: 380.82 lei - 18%
Preț: 1173.54 lei - 20%
Preț: 620.52 lei - 20%
Preț: 1233.02 lei - 20%
Preț: 631.00 lei - 20%
Preț: 1233.33 lei - 20%
Preț: 1849.02 lei - 20%
Preț: 348.43 lei - 20%
Preț: 621.81 lei - 20%
Preț: 322.93 lei - 20%
Preț: 634.14 lei - 20%
Preț: 331.17 lei
Preț: 317.05 lei
Preț vechi: 396.31 lei
-20%
Puncte Express: 476
Carte tipărită la comandă
Livrare economică 29 iulie-12 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783642837265
ISBN-10: 3642837263
Pagini: 208
Ilustrații: IX, 191 p. 1 illus.
Greutate: 0.34 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642837263
Pagini: 208
Ilustrații: IX, 191 p. 1 illus.
Greutate: 0.34 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Modelling and Strong Linear Programs for Mixed Integer Programming.- Advances in Nonlinear Network Models and Algorithms.- Mathematical Programming as an Intellectual Activity.- The Aggregation Principle in Scenario Analysis and Stochastic Optimization.- Methods for Large-scale Linear Programming.- Extended Abstracts.- Resource Constrained Assignment Problems.- The Resource Constrained Spanning Tree Problem: Alternative Modelling and Algorithmic Approaches.- Constructive Dual Methods for Non-Linear Discrete Programming Problems.- A Decomposition Based Procedure for Production Scheduling in Job-Shops with Negligible Setup Times.- An Example of a Declarative Approach to Model Creation.- Optimal Solution of the Local Delivery Problem through Minimum K-trees.- AMPL: A Mathematical Programming Language.- Multiperiod Linear Stochastic Programming and a Forestry Application.- A Multi-Period Network Design Problem: Model and Solution Techniques.- Finite-Dimensional Variational and Quasivariational Inequalities: Algorithmic Developments and Applications in Socio-Economic Planning.- Stochastic Equilibrium Programming for Dynamic Oligopolistic Markets.- A Dynamic Approach to Oligopolistic Market Equilibrium.- Estimated Parameters in Mathematical Programming; Modelling and Statistical Issues.- Modelling for Parallel Optimization.- Long-Term Hydro-Thermal Coordination of Electricity Generation through Multicommodity Network Flows.- Equilibration Operators for the Solution of Constrained Matrix Problem.- A General Dynamic Network Spatial Price Equilibrium Model with Gains and Losses.- Incorporating the Concept of Internal Rate of Return in Linear and Integer Programming Models.- Procedures for Solving Bottleneck Generalized Assignment Problems.- Weighted Matching in Chess Tournaments.- Decentralized Optimization for Structured Linear Programming Models.- Transport Planning in Airborne Operations.- A Hierarchical Approach to the Placement Problem.- Optimisation of Oil Depletion Strategy to Satisfy Long-Term Objectives.- Approaches to Optimizing Fuel Consumption in Cars.- Equilibrium Definitions in Simulated Annealing: A Computational Experiment.- Decomposition in Integer Programming.- Computational Geometry and Low Dimensional Linear Programs.- List of Addresses.