Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 69,48
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 74,03
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 196 pages. 8.66x5.91x0.45 inches. In Stock.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : preigu, Osnabrück, Allemagne
EUR 37,80
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Combinatorial Optimization Problems | Modeling and Solving | Faez Hassan Ali (u. a.) | Taschenbuch | 196 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659936852 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 67,85
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 68,54
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
Langue: anglais
Edité par LAP Lambert Academic Publishing, 2016
ISBN 10 : 3659936855 ISBN 13 : 9783659936852
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 41,90
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In mathematics and computer science, an optimization problem (OP) is the problem of finding the best solution from all feasible solutions. OP's can be divided into two categories depending on whether the variables are continuous or discrete. An OP with discrete variables is known as a combinatorial optimization problem (COP). Over the last few years, the use of COP's has increased exponentially in many fields, marketing, industrial, security communications and aircraft problems. The aim of the research presented in this book is to investigate the use of various optimization exacts and heuristics to solve the COP's. In this book we interest in discussing three samples of COP's; machine scheduling problem (MSP), transposition cipher problem (TCP) and aircraft landing problem (ALP). For these study cases, we first discuss the mathematical modeling (single and multi-objective functions and the constraints) then different solving methods, like exact (Branch and Bound), heuristics, local search methods (Genetic Algorithm, Particle Swarm Optimization and BA) and using Neural Networks. In this book we solve some practical examples obtained from some famous sits.