{"id":"W2019475634","doi":"10.1139/x03-101","title":"Solving the area-restricted harvest-scheduling model using the branch and bound algorithm","year":2003,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Forest Management and Policy","field":"Environmental Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Adjacency list; Scheduling (production processes); Computation; Polygon (computer graphics); Mathematical optimization; Upper and lower bounds; Algorithm; Computer science; Branch and bound; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002011555,0.0001136079,0.0001174211,0.0002067613,0.001257821,0.0004418683,0.0005617305,0.00005491519,0.0004460014],"category_scores_gemma":[0.0004546285,0.00006797871,0.00005751883,0.000649518,0.0008389989,0.0003484331,0.00007296718,0.0006433622,0.00002928694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002752717,"about_ca_system_score_gemma":0.000509119,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02253792,"about_ca_topic_score_gemma":0.07448459,"domain_scores_codex":[0.9981732,0.0002218394,0.000243249,0.0001450721,0.0005325937,0.0006840662],"domain_scores_gemma":[0.9989181,0.0001893837,0.00009141575,0.0002628299,0.00006404379,0.0004742613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002267956,0.00003788643,0.5601789,0.00002517504,0.0001129925,0.000263626,0.004629352,0.3773743,0.000665196,0.01138498,0.02679961,0.01850524],"study_design_scores_gemma":[0.001063453,0.0002366989,0.2146589,0.0001424187,0.00007273391,0.0005863599,0.0008622431,0.6655228,0.0001302216,0.03928148,0.07696327,0.0004794608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9862412,0.0004983079,0.001818897,0.001232405,0.00009638576,0.0002047232,0.000003782957,0.000002481089,0.009901865],"genre_scores_gemma":[0.9960243,0.00006201876,0.001880776,0.0001620129,0.00009898708,0.00000273824,5.270969e-7,0.0000167374,0.001751968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.34552,"threshold_uncertainty_score":0.9839711,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06250490858685419,"score_gpt":0.3055576024334296,"score_spread":0.2430526938465754,"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."}}