Location, Scheduling, Design and Integer Programming - Padberg, Manfred W.
- Format: Broché Voir le descriptif
223,63 €
Produit Neuf
Ou 55,91 € /mois
- Livraison : 3,99 €
- Livré entre le 17 et le 24 septembre
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Location, Scheduling, Design And Integer Programming Format Broché - Livre Économie
0 avis sur Location, Scheduling, Design And Integer Programming Format Broché - Livre Économie
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Pierre Bayle
Neuf dès 222,62 €
-
The Fourth World Omnibus Vol. 2
Neuf dès 134,88 €
-
Quantum Electrodynamics Of Strong Fields
Neuf dès 211,28 €
-
Geometric Quantization And Quantum Mechanics
Neuf dès 123,61 €
-
Flashpoint: The 10th Anniversary Omnibus
Neuf dès 158,08 €
-
Angry Women (Re/Search ; 13)
Occasion dès 113,99 €
-
Advanced Quantum Mechanics
Neuf dès 145,54 €
-
Soviet Military Deception In The Second World War
Neuf dès 195,80 €
-
Norstedts Stora Svensk-Engelska Ordbok : Norstedts Comprehensive Swedish-English Dictionary
Occasion dès 205,00 €
-
Filmer
Neuf dès 119,48 €
-
Introduction To Hilbert Spaces With Applications
Neuf dès 225,99 €
-
Norton Book Of Friendship
Neuf dès 140,30 €
-
Common Sense
Occasion dès 115,00 €
-
Custom Lettering Of The '60s & '70s
Occasion dès 162,00 €
-
Lawrence Weiner: Displacement
Occasion dès 207,99 €
-
Biochemistry
1 avis
Occasion dès 119,99 €
-
Art+Com
Occasion dès 155,99 €
-
Diego Rivera. The Complete Murals
Neuf dès 212,44 €
-
Hitman By Garth Ennis And John Mccrea Omnibus Vol. 2
Neuf dès 114,69 €
-
A Court Of Thorns And Roses Paperback Box Set
Occasion dès 171,95 €
Produits similaires
Présentation Location, Scheduling, Design And Integer Programming Format Broché
- Livre Économie
Sommaire:
1 Location Problems.- 1.1 A Modified KB Model.- 1.2 A Symmetric KB Model.- 1.3 A Five-City Plant Location Example.- 1.4 Plant and Office Layout Planning.- 1.5 Steinberg's Wiring Problem.- 1.6 The General Quadratic Assignment Problem.- 2 Scheduling and Design Problems.- 2.1 Traveling Salesman Problems.- 2.2 Triangulation Problems.- 2.3 Linear Assignment Problems.- 2.4 VLSI Circuit Layout Design Problems.- 2.5 Multi-Processor Assignment Problems.- 2.6 Scheduling Problems with Interaction Cost.- 2.7 Operations-Scheduling Problems.- 2.8 Graph and Clique Partitioning Problems.- 2.9 Boolean Quadric Problems and Relatives.- 2.10 A Classification of Boolean Quadratic Problems.- 3 Solution Approaches.- 3.1 Mixed zero-one formulations of QAPs.- 3.2 Branch-and-bound algorithms for QAPs.- 3.3 Traditional cutting plane algorithms.- 3.4 Heuristic procedures.- 3.5 Polynomially solvable cases.- 3.6 Computational experience to date.- 4 Locally Ideal LP Formulations I.- 4.1 Graph Partitioning Problems.- 4.2 Operations Scheduling Problems.- 4.3 Multi-Processor Assignment Problems.- 5 Locally Ideal LP Formulations II.- 5.1 VLSI Circuit Layout Design Problems.- 5.2 A General Model.- 5.3 Quadratic Assignment Problems.- 5.4 Symmetric Quadratic Assignment Problems.- 6 Quadratic Scheduling Problems.- 6.1 Alternative Formulations of the OSP.- 6.2 Quadratic Scheduling Polytopes.- 7 Quadratic Assignment Polytopes.- 7.1 The Affine Hull and Dimension of QAPn.- 7.2 Some Valid Inequalities for QAPn.- 7.3 The Affine Hull and Dimension of SQPn.- 8 Solving Small QAPs.- A Fortran Programs for Small SQPs.- References.
Détails de conformité du produit
Personne responsable dans l'UE