{"id":"W3165972090","doi":"10.1287/ijoc.2022.1198","title":"A Catalog of Formulations for the Network Pricing Problem","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Robustness (evolution); Enumeration; Shortest path problem; Curse of dimensionality; Preprocessor; Bilevel optimization; Set (abstract data type); Path (computing); Optimization problem; Mathematics; Theoretical computer science; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002349869,0.002172706,0.001383509,0.001423947,0.0009306477,0.003142545,0.002788961,0.002314414,0.0106953],"category_scores_gemma":[0.005416013,0.001012547,0.00241875,0.004381956,0.0008681774,0.003666752,0.001564028,0.004150597,0.003679853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364635,"about_ca_system_score_gemma":0.002051473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001768515,"about_ca_topic_score_gemma":0.002553793,"domain_scores_codex":[0.998751,0.0004460464,0.0001255992,0.0001798532,0.00041045,0.00008698434],"domain_scores_gemma":[0.9984598,0.0007637732,0.0001198136,0.0002979167,0.0003104214,0.00004820685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005816807,0.0002892196,0.0005606597,0.001045435,0.00007894216,0.000150986,0.0001722589,0.1083305,0.001056926,0.6729557,0.04121053,0.1740907],"study_design_scores_gemma":[0.00007278777,0.00007884501,0.0002725192,0.0004747509,0.00005420871,0.0004679298,0.0001351642,0.3901664,0.001049506,0.4983855,0.1087682,0.0000742197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003777278,0.007428544,0.9577659,0.001958545,0.000264761,0.0002684502,0.001038705,0.0003849209,0.02711279],"genre_scores_gemma":[0.06302327,0.02066164,0.8922842,0.001143905,0.0007386343,0.001518248,0.003028993,0.0006736427,0.01692761],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.0106953,"threshold_uncertainty_score":0.03577936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02577667060948249,"score_gpt":0.2993647196029922,"score_spread":0.2735880489935097,"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."}}