36 citations · 143 across the 10 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2020★ 28 cited
A Study of Learning Search Approximation in Mixed Integer Branch and Bound: Node Selection in SCIP
Kaan Yilmaz, Neil Yorke-Smith
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer p…
cs.NE2019★ 36 cited
Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art
Lei He, Arthur Guijt, Mathijs de Weerdt +2
The Order Acceptance and Scheduling (OAS) problem describes a class of real-world problems such as in smart manufacturing and satellite scheduling. This problem consists of simulta…