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:
- 24% Preț: 797.66 lei
- 18% Preț: 957.62 lei
- 18% Preț: 957.13 lei
- 18% Preț: 1227.52 lei
- Preț: 396.40 lei
- Preț: 403.75 lei
- 18% Preț: 1239.37 lei
- 18% Preț: 1236.51 lei
- 18% Preț: 1231.78 lei
- 18% Preț: 1229.10 lei
- 18% Preț: 1835.21 lei
- 24% Preț: 1076.36 lei
- Preț: 390.46 lei
- Preț: 369.63 lei
- 18% Preț: 1232.41 lei
- Preț: 394.51 lei
- 18% Preț: 1226.24 lei
- 18% Preț: 1845.80 lei
- Preț: 399.88 lei
- Preț: 384.28 lei
- Preț: 390.88 lei
- Preț: 381.19 lei
- 18% Preț: 1848.64 lei
- 18% Preț: 951.14 lei
- 18% Preț: 1230.35 lei
- 18% Preț: 1236.51 lei
- Preț: 401.03 lei
- Preț: 406.25 lei
- 18% Preț: 1230.84 lei
- Preț: 418.34 lei
- 18% Preț: 1223.74 lei
Preț: 340.49 lei
Preț vechi: 425.62 lei
-20% Nou
Puncte Express: 511
Preț estimativ în valută:
65.15€ • 68.20$ • 54.23£
65.15€ • 68.20$ • 54.23£
Carte tipărită la comandă
Livrare economică 31 martie-14 aprilie
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.