Recent Advances in Combinatorial Optimization
1East China Institute of Technology, Nanchang, China
2National Formosa University, Yunlin, Taiwan
3Tongji University, Shanghai, China
4Universite d’Evry-Val d’Essone, Paris, France
5Université de Lorraine, Metz, France
Recent Advances in Combinatorial Optimization
Description
Combinatorial optimization is a branch of operations research. The essence of a combinatorial optimization problem is to find optimal solutions or approximation solutions from a finite set of feasible solutions. In such problems the size of feasible solution space increases tremendously with regard to the increase in the size of the input parameters. Many well-known problems such as the traveling salesman problem, the bin packing problem, the knapsack problem, and certain types of scheduling problems are combinatorial optimization problems.
This special issue invites original research articles as well as review articles of the latest advances in various aspects of combinatorial optimization such as problem variations, problem reductions, optimal algorithms, approximation algorithms, heuristics, metaheuristics, exact solution methods, and applications in different fields.
Potential topics include, but are not limited to:
- Bin packing and bin covering problems
- Sequencing and scheduling problems
- Vehicle routing problems
- Matching problems
- Cutting stock problems
- Assignment problems
- Algorithmic game theory
- Portfolio optimization
- Applications and case studies