Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The precedence constrained traveling salesman (TSP-PC), also known as sequential ordering problem (SOP), consists of finding an optimal tour that satisfies the namesake constraints. Mixed integer-linear programming works well with the ‘lightly constrained’ TSP-PCs, close to asymmetric TSP, as well as the with the ‘heavily constrained’ (Gouveia, Ruthmair, 2015). Dynamic programming (DP) works well with the heavily constrained (Salii, 2019). However, judging by the open TSPLIB SOP instances, the worst for any method are the ‘medium’.We implement a parallel Morin–Marsten branch-and-bound scheme for DP (DPBB). We show how the lower bound heuristic parameterizes DPBB's worst-case complexity and DPBB ‘inherits’ the abstract travel cost aggregation feature of the DP, permitting its direct use with both the conventional and bottleneck TSP-PC.The scheme was tested on TSPLIB instances, with best known upper bounds (TSP-PC), or those found by restricted DP (Bottleneck TSP-PC), and lower bounds from a greedy-type heuristic. Our OPENMP-based parallel implementation achieved 20-fold speedup for larger instances. We close the long-standing kro124p.4.sop (conventional TSP-PC) and both kro124p.4.sop and ry48p.2.sop (Bottleneck TSP-PC).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it