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
Optimization and Mathematical Programming
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.

263 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.
263 works in the cohort · of 4,299,418page 3 of 6

Labels cover 0 of 263 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 263 of 263 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
Special issue on recent advances in metaheuristics
Teodor Gabriel Crainic, Michel Gendreau, Louis-Martin Rousseau
2010· article· en· Journal of Heuristics· Engineering
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Solving Large Batches of Linear Programs
Ilbin Lee, Stewart Curry, Nicoleta Serban
2019· article· en· INFORMS journal on computing· Engineering
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
An Exact Method for Fractional Goal Programming
Charles Audet, Emilio Carrizosa, Pierre Hansen
2004· article· en· Journal of Global Optimization· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
A method to solve Pythagorean fuzzy transportation problems
Tanveen Kaur Bhatia, Amit Kumar, S. S. Appadoo, Manoj K. Sharma
2023· article· en· International Journal of Systems Assurance Engineering and Management· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
A scenario based project portfolio selection
Kamran Pourahmadi, Siamak Nouri, Saeed Yaghoubi
2015· article· en· Management Science Letters· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Extensions of the sequential stochastic assignment problem
Arash Khatibi, Golshid Baharian, Banafsheh Behzad, Sheldon H. Jacobson
2015· article· en· Mathematical Methods of Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About