Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, France, 2–13 September, 1974: Nato Science Series C:, cartea 19
Editat de B. Royen Limba Engleză Paperback – 3 oct 2013
Din seria Nato Science Series C:
- 18%
Preț: 1182.47 lei - 24%
Preț: 863.31 lei - 18%
Preț: 920.45 lei - 18%
Preț: 919.98 lei - 18%
Preț: 1179.75 lei -
Preț: 381.34 lei -
Preț: 388.40 lei - 18%
Preț: 1191.12 lei - 18%
Preț: 1188.39 lei - 18%
Preț: 1183.84 lei - 18%
Preț: 1181.26 lei - 18%
Preț: 1763.57 lei - 24%
Preț: 1164.99 lei -
Preț: 375.65 lei -
Preț: 399.98 lei - 18%
Preț: 1184.45 lei -
Preț: 379.51 lei - 18%
Preț: 1178.53 lei - 18%
Preț: 1773.75 lei -
Preț: 384.68 lei -
Preț: 415.84 lei -
Preț: 422.98 lei -
Preț: 412.48 lei - 18%
Preț: 1776.49 lei - 18%
Preț: 914.22 lei - 18%
Preț: 1182.47 lei - 18%
Preț: 1188.39 lei -
Preț: 385.79 lei -
Preț: 390.81 lei - 18%
Preț: 1182.94 lei -
Preț: 402.42 lei - 18%
Preț: 1176.11 lei
Preț: 327.54 lei
Preț vechi: 409.42 lei
-20% Nou
Puncte Express: 491
Preț estimativ în valută:
57.95€ • 68.13$ • 50.76£
57.95€ • 68.13$ • 50.76£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789401175593
ISBN-10: 9401175594
Pagini: 404
Ilustrații: XVI, 386 p. 3 illus.
Dimensiuni: 170 x 244 x 21 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 1975
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Nato Science Series C:
Locul publicării:Dordrecht, Netherlands
ISBN-10: 9401175594
Pagini: 404
Ilustrații: XVI, 386 p. 3 illus.
Dimensiuni: 170 x 244 x 21 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 1975
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Nato Science Series C:
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
I: General Methodology.- Modelling Techniques and Heuristics for Combinatorial Problems.- Les Procedures D’exploration et D’optimisation par Separation et Evaluation: a survey.- Boolean Elements in Combinatorial Optimization: a survey.- Fourier-Motzkin Elimination and its Dual with Application to Integer Programming.- II: Paths and Circuits.- Chemins et Circuits: Enumeration et Optimisation: a survey.- Path Algebra and Algorithms.- Hamiltonian Circuits and the Travelling Salesman Problem: a survey.- The Peripatetic Salesman and some related Unsolved Problems.- Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs.- Finding Minimum Spanning Trees with a Fixed Number of Links at a Node.- III: Set Partitioning, Covering and Packing.- Set Partitioning: a survey.- An Algorithm for Large Set Partitioning Problems.- Le Probleme De Partition Sous Contrainte.- Characterisations of Totally Unimodular, Balanced and Perfect Matrices.- Some Well-Solved Problems in Combinatorial Optimization.- IV: Other Combinatorial Programming Topics.- How to Color a Graph: a survey.- Problemes Extremaux Concernant Le Nombre Des Colorations Des Sommets D’un Graphe Fini.- A few Remarks on Chromatic Scheduling.- Minimizing Total Costs in One-Machine Scheduling.- The Quadratic Assignment Problem: A Brief Review.- Fonctions D’evaluation et Penalites Pour Les Programmes Quadratiques en Variables 0–1.- Solution of the Machine Loading Problem with Binary Variables.- The Role of Puzzles in Teaching Combinatorial Programming.