Open access peer-reviewed Edited Volume

Optimization Algorithms

Nodari Vakhania

Universidad Autónoma del Estado de México

Dr. Vakhania is a researcher in algorithm design and analysis, a full professor, and a member of the National Research System (Mexico). He is an author of nearly 100 research papers including more than 60 publications in highly ranked international journals. He has obtained research grants and honors in Germany, France, the Netherlands, the United States, Russia, and Mexico, and has given more than forty invited talks throughout the world.

Covering

Linear Integer Programming Multi-Criteria Optimization Optimization on Graphs Implicit Enumeration Branch-and-Bound Dynamic Programming Heuristics Meta-Heuristics Hybrid Algorithms Sequencing Deterministic Scheduling Stochastic Scheduling

Register your interest in contributing to this book

Collaborate with our community and contribute your knowledge.

About the book

Computational algorithms nowadays play a definitive role in most of the real-life applications from mobile phones to supercomputers, Internet servers, manufacturing etc. A computational algorithm is designed to optimize a certain measure for the given problem. A discrete algorithm built for an optimization problem normally deals with a large set of feasible solutions (ones that respect problem restrictions), and tries to find a feasible solution that fits better given the optimization criteria. Hence, an intelligent method for the enumeration of feasible solutions may lead to an efficient computational algorithm.

This book is intended to publish recent advances in development of efficient optimization algorithms for traditional discrete optimization and real-life optimization problems, in both single criterion and multi-criteria settings. Novel mathematical models for some real-life optimization problems and their solution methods are also welcome. Such problems may fall into either the class of the polynomially solvable problems or into the class of intractable NP-hard problems. For the first class of problems novel polynomial-time algorithms, and for the second class of problems efficient exact enumeration and approximation heuristic algorithms are welcome. Potential topics include, but are not limited to, linear and integer programming, scheduling and routing, packing and partitioning, optimization in graphs, multi-criteria optimization, time and space complexity analysis, dynamic programming.

Publishing process

Book initiated and editor appointed

Date completed: March 22nd 2021

Applications to edit the book are assessed and a suitable editor is selected, at which point the process begins.

Chapter proposals submitted and reviewed

Deadline for chapter proposals: April 19th 2021

Potential authors submit chapter proposals ready for review by the academic editor and our publishing review team.

Register for the book

Approved chapters written in full and submitted

Deadline for full chapters: June 18th 2021

Once approved by the academic editor and publishing review team, chapters are written and submitted according to pre-agreed parameters

Full chapters peer reviewed

Review results due: September 6th 2021

Full chapter manuscripts are screened for plagiarism and undergo a Main Editor Peer Review. Results are sent to authors within 30 days of submission, with suggestions for rounds of revisions.

Book compiled, published and promoted

Expected publication date: November 5th 2021

All chapters are copy-checked and typesetted before being published. IntechOpen regularly submits its books to major databases for evaluation and coverage, including the Clarivate Analytics Book Citation Index in the Web of ScienceTM Core Collection. Other discipline-specific databases are also targeted, such as Web of Science's BIOSIS Previews.

About the editor

Nodari Vakhania

Universidad Autónoma del Estado de México

Nodari Vakhania graduated with honors from the Faculty of Applied Mathematics and Cybernetics, Tbilisi State University, Georgia, in 1983. In 1989, he entered the PhD program in Computer Science at the Russian Academy of Sciences, Moscow, and obtained a degree in Mathematical Cybernetics in 1991. In 1992, he was a postdoctoral fellow at the Russian Academy of Sciences, and had a short-term visiting position at the University of Saarbrucken, Germany. In 1995, he became a professor at the Centro de Investigación en Ciencias at the State University of Morelos, Mexico. He also has an honorary position at the Institute of Computational Mathematics of the Georgian Academy of Sciences, where he received a doctoral degree in Mathematical Cybernetics in 2004. His research interests include design and analysis of algorithms, discrete optimization, computational complexity and scheduling theory. He is an author of nearly 100 refereed research papers including more than 60 publications in highly ranked international journals. He has also worked with different scientific committees, including those at the Mexican Science Foundation CONACyT. He is an editorial board member and a referee for a number of international scientific journals. He has obtained research grants and honors in Germany, France, the Netherlands, the United States, Russia, and Mexico, and has given more than forty invited talks throughout the world.

View profile

Book chapters authored 2

Books edited 1

Introducing your Author Service Manager

Ms. Karmen Daleta

Ask a question
creativecommons
alpsp
cope
stm
ithenticate
crossref
doi
oaspa

Book will be abstracted and indexed in

googlescholar
worldcat
base
az
openaire