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
Computers & Operations Research
Topic
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.

270 results · 1 filter active ·
Results by year
20022025
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.
270 works in the cohort · of 4,299,418page 1 of 6

Labels cover 1 of 270 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 270 of 270 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.

afffundno abstractunlabeled
The generalized maximal covering location problem
Oded Berman, Dmitry Krass
2002· article· en· Computers & Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
267
citations
affno abstractunlabeled
Time-dependent routing problems: A review
Michel Gendreau, Gianpaolo Ghiani, Emanuela Guerriero
2015· review· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
244
citations
affno abstractunlabeled
Variable neighborhood search and local branching
Pierre Hansen, Nenad Mladenović, Dragan Urošević
2005· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
188
citations
affno abstractunlabeled
An integrated approach for sustainable supply chain planning
Tasseda Boukherroub, Ángel Ruiz, Alain Guinet, Julien Fondrevelle
2014· article· en· Computers & Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
182
citations
affno abstractunlabeled
Hub-and-spoke network design with congestion
Samir Elhedhli, Frank Xiaolong Hu
2004· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
168
citations
afffundno abstractunlabeled
Crowd-shipping with time windows and transshipment nodes
Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte
2019· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
141
citations
afffundno abstractunlabeled
Multi-period Vehicle Routing Problem with Due dates
Claudia Archetti, Ola Jabali, M. Grazia Speranza
2015· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
108
citations
afffundno abstractunlabeled
Markov chain models of a telephone call center with call blending
Alexandre Deslauriers, Pierre L’Ecuyer, Juta Pichitlamken, Ármann Ingólfsson, Athanassios N. Avramidis
2005· article· en· Computers & Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
98
citations
afffundno abstractunlabeled
Tactical network planning for food aid distribution in Kenya
Marie‐Ève Rancourt, Jean‐François Cordeau, Gilbert Laporte, Ben Watkins
2014· article· en· Computers & Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
79
citations

How this was built: Screen · Findings · About