MétaCan
Menu
Back to cohort
Record W1629073290

A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs

2009· article· en· W1629073290 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAlgorithmic operations research · 2009
Typearticle
Languageen
FieldEngineering
TopicOptimization and Packing Problems
Canadian institutionsnot available
Fundersnot available
KeywordsInteger (computer science)Mathematical optimizationInteger programmingTrimStochastic programmingNonlinear systemNonlinear programmingClass (philosophy)ExploitBranch and priceMathematicsComputer scienceArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

This paper addresses the class of nonlinear mixed integer stochastic programming problems. In particular, we consider two-stage problems with nonlinearities both in the objective function and constraints, pure integer first stage and mixed integer second stage ariables. We exploit the specific problem structure to develop a global optimization algorithm. The basic idea is to compose the original problem into smaller manageable optimization subproblems and coordinate their solutions by means of a Branch and Bound approach. Preliminary computational experiments have been carried out on a stochastic version of the Trim Loss problem.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.621
Threshold uncertainty score0.591

Codex and Gemma teacher scores by category

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

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.074
GPT teacher head0.354
Teacher spread0.280 · 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