{"id":"W1765284097","doi":"10.71781/10066","title":"Network pricing problems : complexity, polyhedral study and solution approaches","year":2008,"lang":"en","type":"book","venue":"Library and Archives Canada (Government of Canada)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Toll; Mathematical optimization; Linear programming; Flow network; Integer programming; Integer (computer science); Shortest path problem; Cutting-plane method; Path (computing); Mathematics; Convex hull; Polyhedron; Regular polygon; Computer science; Combinatorics; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.001506743,0.001585318,0.0013949,0.001427961,0.0009375035,0.003752113,0.001852165,0.001871747,0.005403821],"category_scores_gemma":[0.005843284,0.000971765,0.001918244,0.002486279,0.001890265,0.003402938,0.002085319,0.004557587,0.0005506678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003068518,"about_ca_system_score_gemma":0.001602801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006124519,"about_ca_topic_score_gemma":0.005070033,"domain_scores_codex":[0.99867,0.000498353,0.0000607541,0.0002100574,0.0004235275,0.0001373301],"domain_scores_gemma":[0.9974137,0.001893919,0.0002087916,0.00013797,0.0002476635,0.00009800845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002733715,0.0001103001,0.0005233777,0.000325589,0.00004591796,0.0000861108,0.0001405328,0.5454278,0.000358779,0.4182969,0.004733833,0.02992349],"study_design_scores_gemma":[0.00001560893,0.00002657907,0.0001322171,0.00007957986,0.00001404196,0.00005095661,0.0001072532,0.6509624,0.0001842924,0.3392813,0.009131114,0.00001459462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01048712,0.006427229,0.9460129,0.003186036,0.0003344733,0.0001836983,0.0002905128,0.00006438462,0.0330136],"genre_scores_gemma":[0.4129076,0.02719235,0.527115,0.001145504,0.00192394,0.001055703,0.001237384,0.0002550528,0.02716731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006124519,"threshold_uncertainty_score":0.02226377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02524263984497622,"score_gpt":0.1745477549771702,"score_spread":0.149305115132194,"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."}}