{"id":"W2103364890","doi":"10.1287/ijoc.1050.0168","title":"Discrepancy-Based Additive Bounding Procedures","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Search tree; Constraint (computer-aided design); Constraint satisfaction problem; Relaxation (psychology); Mathematical optimization; Mathematics; Branch and bound; Key (lock); Upper and lower bounds; Constraint satisfaction; Local consistency; Computer science; Constraint programming; Node (physics); Simple (philosophy); Search algorithm; Artificial intelligence","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.005595041,0.00190516,0.001483922,0.001699903,0.0008988365,0.002630718,0.005072403,0.002088265,0.007703484],"category_scores_gemma":[0.02360798,0.001009392,0.001884474,0.002090638,0.002713211,0.006297095,0.006658049,0.005442258,0.002168895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001674291,"about_ca_system_score_gemma":0.002532786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001686754,"about_ca_topic_score_gemma":0.002008548,"domain_scores_codex":[0.9944023,0.002110512,0.000273228,0.0008500573,0.001895186,0.0004687555],"domain_scores_gemma":[0.9877124,0.006972579,0.0008614195,0.003080437,0.001006091,0.0003670209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001211196,0.00009202226,0.0007643788,0.000183799,0.00005482886,0.00009894716,0.0002339877,0.3846458,0.003194238,0.5088844,0.004340018,0.09738634],"study_design_scores_gemma":[0.00002196827,0.00005055036,0.00009271337,0.00004694203,0.0000201375,0.00007261128,0.00002263306,0.8337321,0.002160303,0.1567815,0.006976892,0.00002169231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001667931,0.0001189995,0.9955233,0.0001234672,0.00002080104,0.00002898458,0.00004302272,0.0002268783,0.002246611],"genre_scores_gemma":[0.1692661,0.0004610793,0.8234909,0.0003736918,0.0001067398,0.000347923,0.0003204087,0.0005051637,0.005127852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007703484,"threshold_uncertainty_score":0.02958977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009396840119445738,"score_gpt":0.2564636089048323,"score_spread":0.2470667687853865,"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."}}