{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234071,0.0005938321,0.001159206,0.000506249,0.0006161647,0.00142461,0.001075359,0.001015503,0.005711439],"category_scores_gemma":[0.002425673,0.0006023265,0.0005411374,0.001215866,0.0006748243,0.001418425,0.0007374658,0.001195613,0.0005830889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069237,"about_ca_system_score_gemma":0.002614323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02047851,"about_ca_topic_score_gemma":0.01553334,"domain_scores_codex":[0.9994316,0.000254855,0.00001955679,0.00007941049,0.0001154538,0.00009913832],"domain_scores_gemma":[0.9988961,0.0008582384,0.00007072743,0.00005055698,0.00007963095,0.00004469844],"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.00003914547,0.00002337554,0.0001364362,0.00002421254,0.00001272984,0.00001488618,0.00001915166,0.9851841,0.0002106883,0.0054869,0.000525146,0.008323262],"study_design_scores_gemma":[0.00001941395,0.00001091211,0.00003788278,0.000002697655,0.000003762253,0.000004038552,0.000009054634,0.9951996,0.00007900744,0.00433762,0.0002940276,0.000002073242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04605132,0.0003003873,0.9445853,0.0002978857,0.00002522366,0.00008917721,0.0001945051,0.0004804806,0.007975747],"genre_scores_gemma":[0.4853606,0.0004678594,0.5084855,0.00009975162,0.00004499607,0.0004268599,0.0004049019,0.0001734882,0.004536085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02047851,"threshold_uncertainty_score":0.04071862,"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."}}