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 10 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
An efficient heuristic for a hub location routing problem
Mustapha Ratli, Dragan Urošević, Jack Brimberg, Nenad Mladenović, Raca Todosijević
2020· article· en· Optimization Letters· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
venueno affunlabeled
Modeling a four-layer location-routing problem
Mohsen Hamidi, K. Farahmand, Seyed Reza Sajjadi
2011· article· en· International Journal of Industrial Engineering Computations· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
The balanced traveling salesmanproblem
John Larusic, Abraham P. Punnen
2010· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
The Synchronized Location-Transshipment Problem
Teodor Gabriel Crainic, Riccardo Giusti, Daniele Manerba, Roberto Tadei
2021· article· en· Transportation research procedia· Engineering
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
The rescheduling arc routing problem
Marcela Monroy‐Licht, Ciro Alberto Amaya, André Langevin, Louis‐Martin Rousseau
2016· article· en· International Transactions in Operational Research· Engineering
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
The preemptive swapping problem on a tree
Shoshana Anily, Michel Gendreau, Gilbert Laporte
2011· article· en· Networks· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
The Bottleneck TSP
Santosh N. Kabadi, Abraham P. Punnen
2006· book-chapter· en· Combinatorial optimization· Engineering
machine prediction:candidate · noneconsensus · none
18
citations

How this was built: Screen · Findings · About