{"id":"W2486472546","doi":"10.1287/trsc.2015.0665","title":"Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Université de Montréal","keywords":"Cardinality (data modeling); Fixed charge; Mathematics; Set (abstract data type); Cover (algebra); Flow network; Cutting-plane method; Representation (politics); Multi-commodity flow problem; Integer programming; Integer (computer science); Mathematical optimization; Network planning and design; Flow (mathematics); Linear programming; Class (philosophy); Computer science; Engineering; Artificial intelligence; Data mining","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0007247712,0.0001063435,0.0001260571,0.00006241091,0.0002643068,0.00004511706,0.0001205531,0.00003785641,0.00007236878],"category_scores_gemma":[0.0001067336,0.00008429271,0.00002790047,0.0002129546,0.0003664134,0.0002890007,0.000002243267,0.00004649287,0.000003453381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002686095,"about_ca_system_score_gemma":0.000051458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006910157,"about_ca_topic_score_gemma":0.0001605578,"domain_scores_codex":[0.9990349,0.00002310696,0.0002614171,0.0001983164,0.0001906365,0.0002916532],"domain_scores_gemma":[0.9990301,0.0005005941,0.00004664849,0.0001748257,0.0001446943,0.0001031113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002376333,0.0001895196,0.07910625,0.0006797404,0.00007738973,0.00002100731,0.007130839,0.7201855,0.02851851,0.1206877,0.01999219,0.02317372],"study_design_scores_gemma":[0.002814546,0.0001520503,0.2043787,0.0001619228,0.00009851225,0.000002287786,0.0003010864,0.7385311,0.03534624,0.01239131,0.004863965,0.0009582808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07835821,0.00002398666,0.9201989,0.000162102,0.0002012644,0.0003113702,0.0004349903,0.0001691433,0.0001400138],"genre_scores_gemma":[0.9787825,0.0000141595,0.02092586,0.0000544562,0.00003460203,0.00006383113,0.00006052904,0.00001101995,0.00005305316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9004243,"threshold_uncertainty_score":0.3437357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07968868857637491,"score_gpt":0.2886115431773257,"score_spread":0.2089228546009508,"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."}}