{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002716221,0.0001814663,0.000273016,0.00002310028,0.0007306459,0.00003343654,0.0001382671,0.0000556544,0.000008727357],"category_scores_gemma":[0.000001828953,0.0001917439,0.00001791945,0.00005996184,0.0002351064,0.0002444618,0.00004351383,0.0001731065,8.992381e-10],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001536154,"about_ca_system_score_gemma":0.002893882,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01224945,"about_ca_topic_score_gemma":0.2578193,"domain_scores_codex":[0.9976614,0.0001040279,0.0002805183,0.0002612224,0.001419332,0.0002735582],"domain_scores_gemma":[0.9993317,0.0001486397,0.0002413044,0.0000952466,7.692029e-7,0.0001823423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000407823,0.0001457082,0.1664007,0.0005898551,0.0003538815,0.0001290676,0.01756682,0.008600459,0.00001946531,0.780001,0.01587301,0.009912181],"study_design_scores_gemma":[0.002722844,0.0007488806,0.5182381,0.001763409,0.0004724387,0.00001789412,0.04114367,0.01620005,0.00007666669,0.03243272,0.383289,0.002894279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004383582,0.0007228101,0.0003060264,0.00192369,0.0002235606,0.000673219,0.0001198603,0.00003102495,0.9916162],"genre_scores_gemma":[0.6293882,0.0004676367,0.001568064,0.0003332623,0.0002772939,0.00001232205,0.00009855078,0.00003172507,0.3678229],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7475683,"threshold_uncertainty_score":0.9943281,"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."}}