{"id":"W2264454774","doi":"10.1016/j.omega.2016.01.012","title":"Models and column generation approach for the resource-constrained minimum cost path problem with relays","year":2016,"lang":"en","type":"article","venue":"Omega","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Column generation; Relay; Mathematical optimization; Path (computing); Computer science; Lagrangian relaxation; Resource (disambiguation); Constraint (computer-aided design); Mathematics; Computer network; Power (physics)","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":[],"consensus_categories":[],"category_scores_codex":[0.0003643766,0.00008363702,0.00008322042,0.00003186972,0.0003457408,0.000148919,0.0003832627,0.00002997074,0.000002115155],"category_scores_gemma":[0.00001568708,0.00004346468,0.00001847473,0.0001687236,0.00008973026,0.0002536402,0.0001282579,0.00005259233,0.000001088672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002197682,"about_ca_system_score_gemma":0.00004237517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.140616e-7,"about_ca_topic_score_gemma":0.00000967042,"domain_scores_codex":[0.9993374,0.00007056457,0.0001181984,0.0002297131,0.0000978957,0.0001462621],"domain_scores_gemma":[0.9991435,0.0002119462,0.0000569398,0.0004536581,0.00008853671,0.00004540104],"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.00004507051,0.00007372584,0.0001265275,0.00001308076,0.00004461966,7.311669e-7,0.00232527,0.002343521,0.005037207,0.464052,0.01104036,0.5148979],"study_design_scores_gemma":[0.000795685,0.00009110462,0.00004483656,0.00002341786,0.000006463745,0.00001035782,0.00003739684,0.9658825,0.0001783879,0.0004935138,0.03231627,0.0001200481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001431003,0.0003057988,0.9891375,0.003492527,0.00001826657,0.0008124525,0.000003593567,0.00005020781,0.004748704],"genre_scores_gemma":[0.8931436,0.0002214388,0.1041734,0.0003624529,0.00006623156,0.0004629464,0.000005718417,0.000009054052,0.001555138],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.963539,"threshold_uncertainty_score":0.2659194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06348057336691793,"score_gpt":0.2482945791634958,"score_spread":0.1848140057965779,"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."}}