Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems

22 February 2019

Papers citing "Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems"

9 / 9 papers shown

Title
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization Ankur Nath Alan Kuhnle 62 0 0 23 Oct 2024
Enhancing Constraint Programming via Supervised Learning for Job Shop Scheduling Yuan Sun Su Nguyen D. Thiruvady Xiaodong Li Andreas T. Ernst U. Aickelin 55 5 0 26 Nov 2022
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations Ali Baran Tasdemir Tuna Karacan Emir Kaan Kirmaci Lale Özkahya 23 0 0 30 Oct 2022
Learning to Prune Instances of Steiner Tree Problem in Graphs Jiwei Zhang Deepak Ajwani 37 2 0 25 Aug 2022
Learning to Sparsify Travelling Salesman Problem Instances James Fitzpatrick Deepak Ajwani Paula Carroll 36 12 0 19 Apr 2021
Boosting Ant Colony Optimization via Solution Prediction and Machine Learning Yuan Sun Sheng Wang Yunzhuang Shen Xiaodong Li Andreas T. Ernst M. Kirley 66 28 0 29 Jul 2020
Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems Yuan Sun Andreas T. Ernst Xiaodong Li J. Weiner 79 38 0 12 May 2020
Learning fine-grained search space pruning and heuristics for combinatorial optimization Juho Lauri Sourav Dutta Marco Grassia Deepak Ajwani 78 21 0 05 Jan 2020
Learning Multi-Stage Sparsification for Maximum Clique Enumeration Marco Grassia Juho Lauri Sourav Dutta Deepak Ajwani 40 10 0 12 Sep 2019