LMask: Learn to Solve Constrained Routing Problems with Lazy Masking

ArXi:2505.17938v2 Announce Type: replace-cross Routing problems are canonical combinatorial optimization tasks with wide-ranging applications in logistics, transportation, and supply chain management. However, solving these problems becomes significantly challenging when complex constraints are involved. In this paper, we propose LMask, a novel learning framework that utilizes dynamic masking to generate high-quality feasible solutions for constrained routing problems. LMask