39 citations · 59 across the 13 of their papers we have counts for
4 papers · 1 filter
Enhancing Constraint Programming via Supervised Learning for Job Shop Scheduling
Yuan Sun, Su Nguyen, Dhananjay Thiruvady +3
Constraint programming (CP) is a powerful technique for solving constraint satisfaction and optimization problems. In CP solvers, the variable ordering strategy used to select whic…
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules
Dhananjay R. Thiruvady, Su Nguyen, Christian Blum +1
Resource constrained project scheduling is an important combinatorial optimisation problem with many practical applications. With complex requirements such as precedence constraint…
Ranking Constraint Relaxations for Mixed Integer Programs Using a Machine Learning Approach
Jake Weiner, Andreas T. Ernst, Xiaodong Li +1
Solving large-scale Mixed Integer Programs (MIP) can be difficult without advanced algorithms such as decomposition based techniques. Even if a decomposition technique might be app…
Adaptive Solution Prediction for Combinatorial Optimization
Yunzhuang Shen, Yuan Sun, Xiaodong Li +2
This paper aims to predict optimal solutions for combinatorial optimization problems (COPs) via machine learning (ML). To find high-quality solutions efficiently, existing work use…