MétaCan
Menu
Back to cohort
Record W4387334823 · doi:10.1504/ijor.2023.133747

Locating a rectangular barrier facility on the plane: a bi-objective approach

2023· article· en· W4387334823 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Operational Research · 2023
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicFacility Location and Emergency Management
Canadian institutionsUniversity of GuelphMcMaster University
Fundersnot available
KeywordsExpropriationMinimaxSimulated annealingMathematical optimizationComputer scienceInteger programmingFacility location problemPlane (geometry)Integer (computer science)MathematicsGeometryEconomics

Abstract

fetched live from OpenAlex

We study the problem of finding a minimax location for a rectangular barrier facility on the plane and simultaneously minimising the interference of the barrier facility to the interactions among the existing facilities using rectilinear distances. This provides an ex post opportunity to modify an existing network or layout while minimising the disruption. The problem is formulated as a bi-objective problem and a mixed integer program is proposed as a solution methodology. A simulated annealing algorithm is presented for an extension of the problem where expropriation or removal of existing facilities is also possible. We consider expropriation or removal of existing facilities only if such policy is necessary or cost-beneficial.

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 imitation

Not 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.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.492
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.002

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.

Opus teacher head0.119
GPT teacher head0.361
Teacher spread0.242 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it