{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002140297,0.0006924496,0.001170989,0.001587196,0.0005481092,0.00120513,0.001111339,0.001323877,0.006427536],"category_scores_gemma":[0.008893582,0.0006722647,0.0008874658,0.004029396,0.0004623199,0.00208987,0.001185238,0.001786575,0.0006224153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368634,"about_ca_system_score_gemma":0.001423472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004577728,"about_ca_topic_score_gemma":0.006497223,"domain_scores_codex":[0.9988114,0.0006297576,0.00005490191,0.0001124278,0.0003233365,0.00006824473],"domain_scores_gemma":[0.9956307,0.003695228,0.0001388121,0.0001318572,0.0003328845,0.0000704301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001598097,0.0002449583,0.0005067668,0.0001508611,0.00004522074,0.0001121861,0.00009208803,0.7651438,0.001201899,0.0909402,0.00260486,0.1387973],"study_design_scores_gemma":[0.0000173766,0.00002055377,0.00005634808,0.000009248508,0.000007820833,0.00001582586,0.000007392212,0.9813834,0.0002696657,0.01728253,0.0009245524,0.000005314169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005419442,0.0001718398,0.9915469,0.000102152,0.00001965414,0.00003345262,0.00006993148,0.0002490811,0.002387551],"genre_scores_gemma":[0.1029598,0.0002476397,0.8945732,0.00006225277,0.00002393516,0.0001440509,0.0001635896,0.0001446072,0.001680879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006427536,"threshold_uncertainty_score":0.0215022,"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."}}