{"id":"W2114915380","doi":"10.1287/opre.1110.0929","title":"Network Cargo Capacity Management","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Schedule; Operations research; Control (management); Flow network; Stochastic programming; Volume (thermodynamics); Capacity management; Mathematical optimization; Linear programming; Dynamic programming; Air cargo; Command and control; Stochastic control; Optimal control; Transport engineering; Computer network; Mathematics; Engineering; Artificial intelligence; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001452171,0.0001307485,0.0001144233,0.0004070189,0.000869977,0.000414333,0.0004744474,0.0000473208,0.004429062],"category_scores_gemma":[0.00004025302,0.0001219166,0.00005184637,0.00107008,0.0001346224,0.0008215927,0.0004956275,0.0002355345,0.004035818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007017487,"about_ca_system_score_gemma":0.00001327618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089724,"about_ca_topic_score_gemma":0.0007980341,"domain_scores_codex":[0.9982291,0.00004839404,0.0002203403,0.0003433868,0.0005679065,0.000590878],"domain_scores_gemma":[0.9991584,0.00001346803,0.00001664515,0.00049616,0.0002908123,0.000024489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001799803,0.0001724745,0.002806872,0.00008040779,0.00004627399,0.00002597786,0.0001869889,0.0008947942,0.00002443543,0.8488488,0.1441387,0.002756266],"study_design_scores_gemma":[0.0006548553,0.0000332977,0.01643622,0.00006042856,0.00003840681,0.0000013561,0.001726014,0.01836749,0.00006883973,0.01991391,0.942277,0.0004222561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05278026,0.00006241407,0.001099078,0.0007804051,0.000529432,0.0008219759,0.00000141101,0.0001397724,0.9437853],"genre_scores_gemma":[0.9772543,0.00002741956,0.002810542,0.001681239,0.001489008,0.000325328,0.00003244112,0.00003277537,0.01634693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9274383,"threshold_uncertainty_score":0.9967396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2511673845062463,"score_gpt":0.3140859727290876,"score_spread":0.0629185882228413,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}