{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005636258,0.0001963782,0.0001947976,0.0002426699,0.0003482088,0.0003002036,0.0001764291,0.00007357117,0.0000370148],"category_scores_gemma":[0.0002030683,0.0001687655,0.0001025157,0.0003033686,0.00002770845,0.0002664852,0.00002146465,0.0004834718,0.00002847836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001965901,"about_ca_system_score_gemma":0.00008230718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003234597,"about_ca_topic_score_gemma":0.000002272164,"domain_scores_codex":[0.9986339,0.00002855831,0.0005225122,0.0001087907,0.0003084122,0.0003978111],"domain_scores_gemma":[0.9992888,0.0002201528,0.000176427,0.0001160247,0.0001038537,0.00009477029],"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.000008097843,0.00001251578,0.001206636,0.00002749244,0.00001607283,0.00001598928,0.000104966,0.978745,0.000104814,0.0008906298,0.0009116206,0.01795616],"study_design_scores_gemma":[0.0006258485,0.00006145771,0.004620547,0.0003935695,0.00001048166,0.0001302576,0.00007056853,0.9858475,0.003086517,0.00058927,0.00424687,0.0003171438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2782166,0.00007362624,0.6991756,0.00009275914,0.0008685219,0.0001271957,0.0000048994,0.0006145217,0.02082628],"genre_scores_gemma":[0.8816378,0.000004215078,0.1173887,0.0001567097,0.0007117405,0.000001442138,0.000008432275,0.00004254425,0.00004843314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6034212,"threshold_uncertainty_score":0.6882058,"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."}}