{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131962,0.001527496,0.0006964085,0.001051529,0.0005326013,0.002311777,0.001856147,0.001124696,0.003403887],"category_scores_gemma":[0.008822761,0.0007574366,0.001221115,0.002027619,0.0009347225,0.003283056,0.001597038,0.002960751,0.0004351601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147435,"about_ca_system_score_gemma":0.001360153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103574,"about_ca_topic_score_gemma":0.002962699,"domain_scores_codex":[0.9980558,0.0007283955,0.0000852396,0.0001616227,0.0007628149,0.0002062872],"domain_scores_gemma":[0.9975553,0.001538155,0.0002885388,0.0003243494,0.0002264233,0.00006728805],"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.00007854364,0.0001092215,0.0004707292,0.0001162253,0.00002986826,0.00008541767,0.0000773882,0.7901668,0.002134026,0.1390644,0.001435876,0.06623159],"study_design_scores_gemma":[0.0000111231,0.00004573199,0.00009424544,0.00002569134,0.00001167198,0.00002743324,0.00001639039,0.9464222,0.001357173,0.05035735,0.001620774,0.00001015056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472845,0.000247899,0.9801984,0.0001692783,0.00004521362,0.00006925959,0.0001083304,0.00009070869,0.004342462],"genre_scores_gemma":[0.3637965,0.000633065,0.6317199,0.0001503055,0.00008012906,0.0003195083,0.0003970018,0.0001144194,0.002789271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003403887,"threshold_uncertainty_score":0.01138711,"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."}}