Special Issue "Discrete Optimization: Theory, Algorithms, and Applications"
A special issue of Mathematics (ISSN 2227-7390).
Deadline for manuscript submissions: closed (28 February 2019) | Viewed by 31729
Interests: discrete optimization; operations research; scheduling; graph theory; manufacturing systems
Special Issues, Collections and Topics in MDPI journals
Special Issue in Mathematics: Graph-Theoretic Problems and Their New Applications
Special Issue in Algorithms: Exact and Heuristic Scheduling Algorithms
Special Issue in Mathematics: Advances and Novel Approaches in Discrete Optimization
Special Issue in Algorithms: 2020 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: Using Blockchain Technology in the Industry 4.0 Era: Cases and Applications
Special Issue in Mathematics: Mathematical Methods for Operations Research Problems
Special Issue in Algorithms: 2021 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: 1st Online Conference on Algorithms (IOCA2021)
Special Issue in Algorithms: Scheduling: Algorithms and Applications
Special Issue in Mathematics: Recent Advances of Disсrete Optimization and Scheduling
Topical Collection in Algorithms: Feature Papers in Algorithms
Special Issue in Algorithms: 2022 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: Optimization Techniques, Algorithms, Applications for Cloud and Edge/Fog Computing Environments
Special Issue in Mathematics: Optimization Algorithms: Theory and Applications
We invite you to submit your latest research in the area of discrete optimization to this Special Issue, “Discrete Optimization: Theory, Algorithms, and Applications” in the journal Mathematics. We are looking for new and innovative approaches 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, integer programming, combinatorial optimization, graph-theoretic problems, matroids, scheduling, and logistics.
Prof. Dr. Frank Werner
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. Mathematics is an international peer-reviewed open access semimonthly 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 1800 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.
- Nonlinear and Linear Integer Programming
- Optimization on Graphs and Networks
- Greedy Algorithms, Matroids and Submodular Functions
- Polyhedral Combinatorics
- Combinatorial Optimization
- Robust Discrete Optimization
- Optimization under Uncertainty
- Computational Complexity
- Branch and Bound, Cutting-Plane Methods, Dynamic Programming
- Approximation and Randomized Algorithms
- Metaheuristics, Matheuristics
- Interior Point Methods
- Decomposition Methods