{"id":"W3000553024","doi":"10.1007/s10601-019-09306-w","title":"Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"","keywords":"Integer programming; Solver; Exploit; Computer science; Set (abstract data type); Mathematical optimization; Integer (computer science); Inductive logic programming; Tree (set theory); Linear programming; Space (punctuation); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics; Programming language","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.0003043126,0.0001508866,0.0001249052,0.00007936954,0.0001639552,0.0003844951,0.0004140995,0.00005968733,0.00003078547],"category_scores_gemma":[0.00003743898,0.0001001208,0.00002132116,0.0006204779,0.0001643688,0.0003449258,0.0001461198,0.0002312772,0.00003732678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000374246,"about_ca_system_score_gemma":0.0001303277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002939483,"about_ca_topic_score_gemma":0.00024881,"domain_scores_codex":[0.9986889,0.00007082387,0.000207107,0.000494228,0.0003124442,0.0002264489],"domain_scores_gemma":[0.9991264,0.00006499364,0.00005637444,0.0003051227,0.0001657877,0.0002812708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002756314,0.00001929668,0.002213313,0.000005503136,0.000009366535,0.000004648451,0.002167334,0.0006728414,0.0001218886,0.003304961,0.00004223721,0.991411],"study_design_scores_gemma":[0.002235454,0.001455002,0.02758377,0.0001617989,0.00003518491,0.0003085272,0.005351298,0.9473659,0.0008872527,0.002477988,0.01124485,0.0008929957],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03266552,0.000008574455,0.961895,0.003969362,0.00003643771,0.0009121831,0.000006110643,0.0001768194,0.0003299804],"genre_scores_gemma":[0.8209844,0.000003753387,0.1782401,0.0006519008,0.00002347868,0.00006835464,0.00001518976,0.000008539422,0.000004266899],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.990518,"threshold_uncertainty_score":0.4082808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02200102872839966,"score_gpt":0.2629475568475838,"score_spread":0.2409465281191841,"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."}}