Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 26,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Noor Publishing 8/22/2025, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 29,01
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. Methods for combinatorial optimization -With examples. Book.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 30,15
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 28,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 28,26
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 30,38
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por KS Omniscriptum Publishing, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: preigu, Osnabrück, Alemania
EUR 23,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por KS Omniscriptum Publishing, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 29,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Idioma: Inglés
Publicado por KS Omniscriptum Publishing, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 28,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 32,98
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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 multiple locations in the US or from the UK, depending on stock availability.
Idioma: Inglés
Publicado por Omniscriptum, Noor Publishing, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 24,90
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 44,92
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 50,76
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 46,02
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 32,44
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Idioma: Inglés
Publicado por KS Omniscriptum Publishing, 2025
ISBN 10: 6200046379 ISBN 13: 9786200046376
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 27,36
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.