The page you are requesting does not exist. You can start your search here!

New paradigms for solving Combinatorial Optimisation problems

Updated: 2 months ago
Location: Melbourne, VICTORIA
Deadline: The position may have been removed or expired!

In this project we are interested in exploring new paradigms for solving Combinatorial Optimisation problems, and generally NP-hard ones. One direction of research could consist in using approximation algorithms for deriving dual bound within a branch-and-bound algorithms. Other directions could use Machine Learning or new decompositions. This subject is generally quite open so it is important to be highly creative.


Required knowledge

Combinatorial optimisation



Similar Positions