Special Issue: Discrete Optimization: Theory, Algorithms and New Applications
Guest Editor
Prof. Frank Werner
Faculty of Mathematics, Otto-von-Guericke University, Magdeburg, Germany
Email: frank.werner@ovgu.de
Manuscript Topics
Discrete optimization is an important branch of optimization in applied mathematics and computer science, where functions are optimized over discrete sets of feasible solutions. This subject has undergone an enormous develepment during the last decades, and it has many interesting applications in all fields of daily life. For this special issue, authors are invited to present the latest research for solving discrete optimization problems exactly or approximately. High-quality papers are solicited to address both theoretical and practical issues of discrete optimization. Submissions are welcome presenting new theoretical results, structural investigations, new models and algorithmic approaches as well new applications of discrete optimization problems.
Potential topics include, but are not limited to:
• Nonlinear and linear integer programming
• Optimization problems on graphs and networks
• Scheduling
• Combinatorial optimization
• Optimization in production, logistics and transport
• Optimization under uncertainty, robust discrete optimization
• Branch and bound, cutting-plane methods, dynamic programming, complexity issues
• Approximation and randomized algorithms
• Online algorithms
• Advanced heuristics, metaheuristics, and matheuristics
• Constraint programming
Instruction for Authors
http://www.aimspress.com/math/news/solo-detail/instructionsforauthors
Please submit your manuscript to online submission system
https://aimspress.jams.pub/