Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 26,75
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Langue: anglais
Edité par Noor Publishing 8/22/2025, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
EUR 29,11
Quantité disponible : 5 disponible(s)
Ajouter au panierPaperback or Softback. Etat : New. Methods for combinatorial optimization -With examples. Book.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 30,25
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 29,17
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 28,83
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 30,72
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par KS Omniscriptum Publishing, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : preigu, Osnabrück, Allemagne
EUR 23,25
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Methods for combinatorial optimization -With examples | Omar Selt | Taschenbuch | Englisch | 2025 | KS Omniscriptum Publishing | EAN 9786200046376 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.
Langue: anglais
Edité par KS Omniscriptum Publishing, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 29,50
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Langue: anglais
Edité par KS Omniscriptum Publishing, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 28,86
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Langue: anglais
Edité par Omniscriptum, Noor Publishing, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 24,90
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included. 52 pp. Englisch.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 45,07
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 50,93
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 46,02
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
Vendeur : CitiRetail, Stevenage, Royaume-Uni
EUR 32,81
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : new. Paperback. A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Langue: anglais
Edité par KS Omniscriptum Publishing, 2025
ISBN 10 : 6200046379 ISBN 13 : 9786200046376
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 27,36
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included.