Decomposability Conditions of Combinatorial Optimization Problems

  • Marouene ChaiebEmail author
  • Jaber Jemai
  • Khaled Mellouli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9101)


Combinatorial Optimization Problems (COP) are generally complex and difficult to solve as a single monolithic problem. Thus, the process to solve the main initial COP may pass through solving intermediate problems and then combining the obtained partial solutions to find initial problem’s global solutions. Such intermediate problems are supposed to be easier to handle than the initial problem. To be modeled using the hierarchical optimization framework, the master problem should satisfy a set of desirable conditions. These conditions are related to some characteristics of problems which are: multi-objectives problem, over constrained problems, conditions on data and problems with partial nested decisions. For each condition, we present supporting examples from the literature where it was applied. This paper aims to propose a new approach dealing with hard COPs particularly when the decomposition process leads to some well-known and canonical optimization sub-problems.


Hierarchical optimization Decomposability conditions Complex problems Problem with nested decisions Large scale data sets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bartk, R.: Constraint hierarchy networks. In: Proceedings of the 3rd ERCIM/Compulog Workshop on Constraints, Lecture Notes in Computer Science. Springer (1998)Google Scholar
  2. 2.
    Begur, S., Miller, D., Weaver, J.: An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 27(4), 35–48 (1997)CrossRefGoogle Scholar
  3. 3.
    Clark, A., Walker, H.: Nurse rescheduling with shift preferences and minimal disruption. Journal of Applied Operational Research 3(3), 148–162 (2011)Google Scholar
  4. 4.
    Halford, G., Wilson, W., Phillips, S.: Processing capacity defined by relational complexity: Implications for comparative, developmental, and cognitive psychology. Behavioral & Brain Sciences 21(6), 803–864 (1998)Google Scholar
  5. 5.
    Hertz, A., Lahrichi, N.: A patient assignment algorithm for home care services. Journal of the Operational Research Society 60, 481–495 (2009)CrossRefzbMATHGoogle Scholar
  6. 6.
    Jemai, J., Chaieb, M., Mellouli, K.: The home care scheduling problem: a modeling and solving issue. In: Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization (2013)Google Scholar
  7. 7.
    Mullinax, C., Lawley, M.: Assigning patients to nurses in neonatal intensive care. Journal of the Operational Research Society 53, 25–35 (2002)CrossRefzbMATHGoogle Scholar
  8. 8.
    Mutingi, M., Mbohwa, C.: A satisficing approach to home healthcare worker scheduling. In: International Conference on Law, Entrepreneurship and Industrial Engineering (2013)Google Scholar
  9. 9.
    Phillips, S.: Measuring relational complexity in oddity discrimination tasks. Noetica 3(1), 1–14 (1997)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.LARODEC Institut Supérieur de Gestion de TunisLe BardoTunisie

Personalised recommendations