Sign inGet started
Paper · arXiv

Learned Pairwise Deep Dual-Optimal Inequalities for Stabilizing Column Generation

Column generation (CG) is central to many large-scale optimization algorithms, including branch-price-and-cut methods for vehicle routing problems, but unstable dual solutions can substantially slow its convergence. Existing deep dual-optimal inequalities can reduce this instability by restricting the dual space. Their construction, however, typically relies on problem-specific exchange arguments that are difficult to establish for routing problems with capacity limits, time windows, and other resource constraints. We introduce learned pairwise deep dual-optimal inequalities (L-PDDOIs), a learning framework that predicts pairwise orderings between dual variables and incorporates their pri...

AuthorsZhengzhong Ricky You, Bo Tang, Haoran Liu et al.
Primary categorymath.OC
Published15 July 2026
Last updated at source15 July 2026
math.OCcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/7233b008-45d6-4935-af3a-e11253928645" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.