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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Faez Hassan is Assistant Professor in Mathematics at the University of Al-Mustansiriyah, Baghdad, Iraq. He earned his B. Sc. in Mathematics, M. Sc. with "Applications of Numerical Analysis for LFSR Systems" and Ph. D. with "Combinatorial Optimization Problems" from the same university. He interest in data security, Operation Research and AI.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ali Faez HassanFaez Hassan is Assistant Professor in Mathematics at the University of Al-Mustansiriyah, Baghdad, Iraq. He earned his B. Sc. in Mathematics, M. Sc. with Applications of Numerical Analysis for LFSR Systems and Ph. D. . N° de réf. du vendeur 159147985
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. 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. N° de réf. du vendeur 9783659936852
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 196 pp. Englisch. N° de réf. du vendeur 9783659936852
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 196 pp. Englisch. N° de réf. du vendeur 9783659936852
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 196 pages. 8.66x5.91x0.45 inches. In Stock. N° de réf. du vendeur 3659936855
Quantité disponible : 1 disponible(s)