MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Vehicle Routing Optimization Methods
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,187 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,187 works in the cohort · of 4,299,418page 17 of 24

Labels cover 1 of 1,187 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,187 of 1,187 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Recent Algorithmic Advances for Arc Routing Problems
Gianpaolo Ghiani, Alain Hertz, Gilbert Laporte
2002· book-chapter· en· International series in management science/operations research/International series in operations research & management science· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Variable Neighborhood Search
Dragan Urošević, Raca Todosijević, Nenad Mladenović, Jack Brimberg
2023· book-chapter· en· Springer optimization and its applications· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Discrepancy-Based Additive Bounding Procedures
Andrea Lodi, Michela Milano, Louis-Martin Rousseau
2006· article· en· INFORMS journal on computing· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Flexible Milk-Runs for Stochastic Vehicle Routing
Ben Peterson, Willem‐Jan van Hoeve, Sham Kekre, Laurens Debo
2018· article· en· Journal of Cell Science· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
A joint routing and speed optimization problem
Ricardo Fukasawa, Qie He, Fernando Afonso Santos, Yongjia Song
2016· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affvenueaboutunlabeled
Metaheuristics: A Canadian Perspective
Michel Gendreau, Jean‐Yves Potvin
2008· article· en· INFOR Information Systems and Operational Research· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Hub Location Models Under Uncertainty
Gita Taherkhani, Sibel A. Alumur
2023· book-chapter· en· International series in management science/operations research/International series in operations research & management science· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Vehicle Routing
Jean‐Yves Potvin
2008· book-chapter· en· Encyclopedia of Optimization· Engineering
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About