Combinatorial Optimization: New Frontiers in Theory and Practice: NATO ASI Subseries F:, cartea 82
Editat de Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekçíen Limba Engleză Paperback – 16 dec 2011
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ț: 625.58 lei
Preț vechi: 781.98 lei
-20%
Puncte Express: 938
Carte tipărită la comandă
Livrare economică 24 iulie-07 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs 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: 9783642774911
ISBN-10: 3642774911
Pagini: 352
Ilustrații: XII, 334 p.
Dimensiuni: 170 x 242 x 18 mm
Greutate: 0.56 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642774911
Pagini: 352
Ilustrații: XII, 334 p.
Dimensiuni: 170 x 242 x 18 mm
Greutate: 0.56 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Variable Decomposition, Constraint Decomposition and Cross Decomposition in General Mathematical Programming.- Surrogate Constraint Methods for Linear Inequalities.- An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow.- A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times.- The Linear Assignment Problem.- Cost Allocation in the Oil Industry: An Example.- On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought?.- Dynamic Basis Partitioning for Network Flows with Side Constraints.- Combinatorial Optimization Models Motivated by Robotic Assembly Problems.- Job Shop Scheduling.- On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems.- Solving Large Scale Multicommodity Networks Using Linear-Quadratic Penalty Functions.- An Analysis of the Minimal Spanning Tree Structure.- Genetic Algorithms: A New Approach to the Timetable Problem.- A New Approximation Technique for Hypergraph Partitioning Problem.- Optimal Location of Concentrators in a Centralized Teleprocessing Network.- A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows.- The Linear Complementarity Problem, Sufficient Matrices and the Criss-Cross Method.- A Characterization of Lifted Cover Facets of Knapsack Polytope with GUB Constraints.- On Pleasant Knapsack Problems.- Extensions of Efficient Exact Solution Procedures to Bicriterion Optimization.- Combinatorial Aspects in Single Junction Control Optimization.- Approximation Algorithms for Constrained Scheduling.- An Analogue of Hoffman’s Circulation Conditions for Max-Balanced Flows.- Some Telecommunications Network Design Problems and the Bi-Steiner Problem.- ParallelMachine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.- Exact Solution of Multiple Traveling Salesman Problems.- A Nonlinear Two-Stage Cutting Stock Problem.- The Probabilistic Behavior of the Generalized HARMONIC Algorithm for the On-Line, Multi-Dimensional Bin Packing.- Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.- A Phase I That Solves Transportation Problems.- A Polynomially Bounded Dual Simplex Algorithm for Capacitated Minimum Cost Flow Problem.- Formulation and a Lagrangean Relaxation Procedure, for Solving Part Scheduling and Tool Loading Problems, in FMS.- Euclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs.- A Set Covering Formulation of the Matrix Equipartition Problem.- Maximizing a Submodular Function by Integer Programming: A Polyhedral Approach.- New Bounds for the Asymmetric Traveling Salesman Problem.- A Lagrangean Heuristic for Set Covering Problems.