Combinatorics looks at permutations and combinations. Optimization explores ways to make any operation work more efficiently within given constraints. Together, they provide powerful methods for modelling and solving large management problems, from optimizing flight schedules to making a factory’s layout as efficient as possible.

Combinatorics is the mathematics of discretely structured problems. Combinatorics is used frequently in computer science to obtain formulas and estimates in the analysis of algorithms. Combinatorics includes the theories of graphs, enumeration, designs and polyhedra. Combinatorics has become indispensable to modern computer science with its discrete formulations for problems.

Optimization, or mathematical programming, is the study of maximizing and minimizing functions subject to specified boundary conditions or constraints. The functions to be optimized arise in engineering, the physical and management sciences, and in various branches of mathematics. In engineering and management science, optimization forms an important part of the discipline of operations research. With the emergence of the computer age, optimization experienced a dramatic growth as a mathematical theory, enhancing both combinatorics and classical analysis.

Combinatorial optimization is the process of searching for maxima (or minima) of an objective function whose domain is a discrete but large configuration space. Combinatorial optimization is a subfield of mathematical optimization that is related to operations research, algorithm theory, and computational complexity theory. It often involves determining the way to efficiently allocate resources used to find solutions to mathematical problems.

Prospective authors are kindly encouraged to contribute to and help shape the conference through submissions of their high-quality, original research abstracts and papers. Also, high quality research contributions describing original and unpublished results of conceptual, constructive, empirical, experimental, or theoretical work in all areas of “Combinatorics and Optimization” are cordially invited for presentation at the conference. Topics of interest in all aspects of Combinatorics and Optimization including, but not limited to:


  • Combinatorial designs,
  • Graph theory,
  • Complex Network Optimization
  • Computational Algebra
  • Computational Geometry
  • Computational Biology
  • Computational Financing
  • Computational Game Theory
  • Computational Learning Theory
  • Computational Number Theory
  • Linear programming,
  • Nonlinear optimization,
  • Operations research
  • Combinatorial optimization,
  • Multi-Objective Optimization
  • Multi-Objective Optimization Problem on Combinatorial Configurations
  • Algorithms and Data Structures
  • Approximation Algorithms
  • Communication Network Optimization
  • Optimal Resource Management
  • Decision-Making Strategy
  • Optimization and Machine Learning in e-Commerce Logistics
  • Optimizations for heterogeneous targets,
  • Distributed Computational Systems
  • Urban Transportation Networks
  • Mobile Ad Hoc Networks
  • Scheduling
  • Big Data
  • ICCAP'21