Combinatorial optimisation problems are known for their high level of complexity. Problems such as, but not limited to, the travelling salesman problem, the multiple knapsack problem, or the generalised assignment problem, have attracted the interest of many researchers for many years. A plethora of different solution approaches have been used in order to find the solution to such hard optimisation problems. Some of these approaches include exact methods and algorithms from Operations Research (OR), while other approaches include techniques like meta-heuristics from other scientific fields such as Artificial Intelligence (AI). Therefore, combinatorial optimisation models for decision making in real life applications constitute a challenging research area. The domain of applicability of combinatorial optimisation problems is extraordinarily broad. Examples of applications area include routing and scheduling, financial and industrial fields, and telecommunications, to name but a few. The objective of this special issue is to present modern applications of combinatorial optimisation models to the decision making in management.
Suitable topics include, but are not limited to:
- Real life applications of combinatorial optimisation models
- Modelling of large scale combinatorial optimisation problems
- New modelling approaches for combinatorial optimisation problems
- Network flow models for decision making
- Evaluation of currently-used combinatorial optimisation models for decision making
- Decision support systems featuring embedded combinatorial optimisation techniques
- Combinatorial optimisation case studies in the fields of management, finance, military and industry
Important Dates
Submission deadline: 30 September 2010
Author notification - review comments: 20 December 2010
Second review cycle: 31 March 2011
Final manuscript due: 20 May 2011
No comments:
Post a Comment