Algorithms for Complex Problems
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".
Deadline for manuscript submissions: 31 January 2025 | Viewed by 671
Special Issue Editors
Interests: artificial intelligence; machine learning; operations research; constraint programming; satisfiability; optimization; forecasting
Interests: scheduling; graph theory; optimization; mathematical modeling; supply chain optimization; logistics; transportation; production systems
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
Most work on optimization focuses on simple situations with one decision-making agent, one objective, and a number of constraints. These problems can be hard to solve to optimality, yet they ignore several real-world complexities. In an uncertain world, industry is increasingly concerned with risk, uncertainty, robustness, and balancing conflicting goals, and less interested in optimal solutions to oversimplified models.
This Special Issue aims to publish recent advances in algorithms for problems that may be multi-agent, multi-objective, multi-level, multi-stage, or have incomplete information. Of particular interest are problems combining complexities such as those studied in multi-objective multi-agent reinforcement learning, bilevel optimization under uncertainty, and influence diagrams. Research areas of interest include the following:
- Stochastic programming;
- Bilevel programming;
- Dynamic programming;
- Reinforcement learning;
- Game theory;
- Robust optimization;
- Metaheuristics;
- Greedy and heuristic algorithms;
- Machine learning;
- Simulation optimization.
Dr. Steven Prestwich
Prof. Dr. Massimiliano Caramia
Guest Editors
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- multi-objective optimization
- multi-level optimization
- multi-agent reinforcement learning
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.
Further information on MDPI's Special Issue polices can be found here.
