{"id":"W1988645991","doi":"10.1016/j.cor.2012.01.005","title":"A Tabu search algorithm for the network pricing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Wilfrid Laurier University; SNC-Lavalin (Canada)","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Combinatorial optimization; Flow network; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008297322,0.0002006087,0.0002095195,0.0002901779,0.00316075,0.0009910872,0.002941882,0.00008629362,0.00002098674],"category_scores_gemma":[0.000158854,0.0001462982,0.0001192854,0.002806911,0.0003982336,0.001340945,0.001706109,0.0008972108,0.0001518726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001953387,"about_ca_system_score_gemma":0.0003621583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006813715,"about_ca_topic_score_gemma":0.00002242446,"domain_scores_codex":[0.9949493,0.0009013254,0.0003421193,0.0005765275,0.001221227,0.00200949],"domain_scores_gemma":[0.9942721,0.002941827,0.00002076851,0.001336707,0.001067868,0.0003606916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000109854,0.0001611446,0.0002050451,0.00002200802,0.00007107967,0.000003303082,0.002463615,0.0862132,0.0002750845,0.3515529,0.01012911,0.5488925],"study_design_scores_gemma":[0.0003647523,0.0001645413,0.0004115277,0.0000332538,0.000003429112,0.00002458152,0.0001672734,0.9714524,0.0004495434,0.003833158,0.02289858,0.0001969308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006301674,0.001456619,0.9911312,0.003339852,0.000494517,0.002308632,0.000005737405,0.0001501958,0.0004830086],"genre_scores_gemma":[0.0956668,0.0001176324,0.8999193,0.0002782904,0.0014114,0.001057424,0.00001357802,0.00004413163,0.001491414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8852392,"threshold_uncertainty_score":0.998137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08855724499197673,"score_gpt":0.395153740080684,"score_spread":0.3065964950887073,"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."}}