Comparison of ILP Formulations for the RWA Problem
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
We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networks with a unified and simplified notation under asymmetrical assumptions on the traffic. We show that all formulations proposed under asymmetrical traffic assumptions, both link and path formulations, are equivalent in terms of the upper bound value provided by the optimal solution of their linear programming relaxation, although their number of variables and constraints differ. We also propose some improvements for some of the formulations that result in the elimination of potential looping lightpaths and lead to further reductions in the number of variables and constraints. We next discuss the easiness of adding a constraint on the number of hops (i.e., how to take into account the node/link attenuating effect) depending on the formulations. Under the objective of minimizing the blocking rate, we propose an experimental comparison of the best lower and upper bounds that are available. We then discuss the easiness of exact ILP solution depending on the formulations. We solve exactly for the first time some RWA (Routing and Wavelength Assignment) instances, including those proposed by Krishnaswamy and Sivarajan (2001), with a proof of the optimality. The conclusion is that LP relaxations bounds often provide solutions with a value very close to the optimal ILP one.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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