Combinatorial (or discrete) optimisation is one of the most active topics in the area of operations research. Combinatorial optimisation constitutes the synergy between applied mathematics, computer science and management science. Furthermore, combinatorial optimisation is a very challenging research field that is encountered in various real-life areas.
Problems of combinatorial optimisation arise in various applications, including production systems, communication networks, logistical systems, airline crew scheduling, maintenance and reliability, corporate planning, computer-aided design, service systems, database query design, cellular telephone frequency assignment, strategic planning, supply chain management, resource allocation problems and computational biology. Motivated by their practical interest, numerous research teams have studied theoretical and applied aspects of combinatorial optimisation using various methods based upon exact and/or approximate approaches.
Theoretical and/or empirical contributions that make a significant contribution to this field are welcome.
The issue will carry revised and substantially extended versions of selected papers presented at the International Conference on Modeling, Simulation and Applied Optimization (ICMSAO’2013), but we also strongly encourage researchers unable to participate in the conference to submit articles for this call.
Suitable topics include but are not limited to:
Submission of manuscripts: 31 December, 2013
- Metaheuristic algorithms
- Exact algorithms
- Cutting and packing
- Polyhedral theory
- Computational complexity
- Graph and network algorithms
- Linear and integer programming
- Interior point methods
- Constraint programming
- Frequency assignment
- Location
- Network design
- Production and logistics scheduling
- Timetabling
- Vehicle routing and scheduling
- Computational biology
- Computational complexity
Submission of manuscripts: 31 December, 2013
No comments:
Post a Comment