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üfekcien Limba Engleză Paperback – 16 dec 2011
Din seria NATO ASI Subseries F:
- 20% Preț: 650.27 lei
- 20% Preț: 668.55 lei
- 20% Preț: 992.44 lei
- 18% Preț: 1239.19 lei
- 20% Preț: 1928.45 lei
- 20% Preț: 654.37 lei
- 18% Preț: 1234.00 lei
- 20% Preț: 709.78 lei
- 20% Preț: 656.03 lei
- 18% Preț: 1854.94 lei
- 20% Preț: 374.97 lei
- 20% Preț: 991.94 lei
- 20% Preț: 671.02 lei
- 20% Preț: 1925.96 lei
- 20% Preț: 994.73 lei
- Preț: 389.49 lei
- 20% Preț: 657.99 lei
- 20% Preț: 655.20 lei
- 18% Preț: 1225.31 lei
- 18% Preț: 952.09 lei
- 20% Preț: 332.06 lei
- 20% Preț: 1284.47 lei
- 20% Preț: 644.81 lei
- Preț: 395.85 lei
- 18% Preț: 1221.07 lei
- 15% Preț: 643.34 lei
- 20% Preț: 645.47 lei
- 20% Preț: 1282.98 lei
- 20% Preț: 656.36 lei
- 20% Preț: 1283.31 lei
- 20% Preț: 1924.15 lei
- 20% Preț: 362.24 lei
Preț: 650.73 lei
Preț vechi: 813.41 lei
-20% Nou
Puncte Express: 976
Preț estimativ în valută:
124.55€ • 129.54$ • 104.37£
124.55€ • 129.54$ • 104.37£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
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.