arXiv:2610. 21001v1 Announce Type: new Abstract: Column generation folklore warns that initial columns hurt: a warm start may bias the dual and slow the root of branch-price-and-cut.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2607. 13373v1 Announce Type: cross Abstract: 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.
The paper introduces CostStart, a method that learns warm starts for the simplex algorithm by predicting which variables will be basic at optimality and then selecting the number of predicted columns, algorithm, and pricing rule based on measured instruction counts. Experiments on 25 classes of linear programs show that while a strong supervised predictor can reduce dual simplex iterations by two thirds, it only cuts solve time by one third; CostStart mitigates this gap and roughly halves solve time compared to the solver’s default start, outperforming two published methods on unseen problems up to four times larger.
arXiv:2610.14792v1 Announce Type: new Abstract: Online, same-day delivery requires operators to constantly update their routes, and the routing cost for deliveries increases with the number of custom...
arXiv:2607. 20594v1 Announce Type: cross Abstract: When does a weight-tied looped transformer -- one block applied T times -- implement an actual algorithm?
The paper presents a method for reducing the size of Quadratic Unconstrained Binary Optimization (QUBO) models used to solve the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) on quantum annealers. It introduces adaptive penalty calibration to improve constraint satisfaction and replaces hand‑tuned merge heuristics with a graph neural network (GNN) that consistently achieves higher feasibility across Solomon benchmark families. Experiments on simulated annealing and a D‑Wave Advantage2 processor show significant reductions in constraint violations and improved feasibility rates, with the QUBO size remaining 5–6 times smaller.
arXiv:2608. 04804v1 Announce Type: cross Abstract: Frontier language models can resolve repository-level software issues, but each attempt is expensive, and existing routers select a model from the issue text alone.