A01=Maurice Clerc
algorithms
Author_Maurice Clerc
Category=PBUD
Category=PBW
Category=PHQ
Category=UMB
chromatic number
combinatorial games
constraint satisfaction
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
eq_science
mathematical optimisation
metaheuristics
minimal valid colouring algorithms
polynomial complexity
quantum
resource allocation
Product details
- ISBN 9781032737515
- Weight: 460g
- Dimensions: 178 x 254mm
- Publication Date: 16 Dec 2024
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications.
The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.
Maurice Clerc is a French mathematician. He worked in the Research and Development Department of France Télécom. Retired since 2004, he remains active in various fields of research, both in particle swarm optimization (PSO)-related fields and in other areas. He regularly publishes articles, gives keynote speeches in conferences, serves as a director and thesis jury, and occasionally works as an optimization consultant.
