{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008433516,0.001245009,0.001169222,0.0008425877,0.0004556938,0.001530996,0.002039275,0.001606124,0.008837175],"category_scores_gemma":[0.003328462,0.0006727804,0.0006907551,0.00159388,0.0009538438,0.001774138,0.001120644,0.001880281,0.000951717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001457318,"about_ca_system_score_gemma":0.001236235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008144812,"about_ca_topic_score_gemma":0.007878752,"domain_scores_codex":[0.9995012,0.0002317531,0.0000136997,0.00007146198,0.0001043325,0.0000775268],"domain_scores_gemma":[0.9980024,0.001478957,0.000159954,0.00007322208,0.0002140129,0.00007155468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003221237,0.00002426747,0.00009113718,0.00005639909,0.00001585463,0.00005277342,0.00004254459,0.9113572,0.0003329735,0.08009218,0.002710545,0.005191909],"study_design_scores_gemma":[0.000006346882,0.000007426615,0.00001989405,0.000005209086,0.00000500567,0.0000100633,0.000008293604,0.9789144,0.00005921558,0.02054635,0.0004127294,0.000005011631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01069354,0.0005388492,0.9763314,0.0006873797,0.00007339784,0.00005345131,0.0003995196,0.0001519544,0.01107043],"genre_scores_gemma":[0.738546,0.002225024,0.2153435,0.0005478745,0.0002503649,0.0005425373,0.0009596717,0.0002975384,0.04128746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008837175,"threshold_uncertainty_score":0.02956325,"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."}}