2 papers
cs.LG2026
Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning
Yicheng Pan, Ruisong Zhou, Haijun Zou +2
The quadratic assignment problem (QAP) is a fundamental NP-hard task that poses significant challenges for both traditional heuristics and modern learning-based solvers. Existing Q…
math.OC2026
LMask: Learn to Solve Constrained Routing Problems with Lazy Masking
Tianyou Li, Haijun Zou, Jiayuan Wu +1
Routing problems are canonical combinatorial optimization tasks with wide-ranging applications in logistics, transportation, and supply chain management. However, solving these pro…