{"id":"W2917843279","doi":"","title":"The SCIP Optimization Suite 3.2","year":2016,"lang":"en","type":"article","venue":"TUbilio (Technical University of Darmstadt)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Integer programming; Heuristics; Suite; Linear programming; Mathematical optimization; Branch and bound; Nonlinear programming; Quadratic programming; Optimization problem; Constraint programming; Parallel computing; Algorithm; Programming language; Nonlinear system; Mathematics; Stochastic programming","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.002674515,0.002353118,0.001807464,0.001997425,0.000627635,0.002647035,0.002873106,0.001284225,0.07880018],"category_scores_gemma":[0.009249188,0.001251873,0.002407773,0.002497435,0.0004510664,0.001414192,0.001835749,0.00336743,0.05217941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007876633,"about_ca_system_score_gemma":0.003418278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003800499,"about_ca_topic_score_gemma":0.004169132,"domain_scores_codex":[0.9982256,0.0005389459,0.0001549734,0.0001935721,0.0006699689,0.0002169903],"domain_scores_gemma":[0.9964336,0.00183134,0.0002198741,0.000446533,0.0009300442,0.0001385423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000359206,0.0002397965,0.00187561,0.002915151,0.0003740751,0.0003899185,0.0001120623,0.07003202,0.003367489,0.03996858,0.7078909,0.1724752],"study_design_scores_gemma":[0.0003938982,0.0001336545,0.001546305,0.0004330121,0.0001583084,0.0004308351,0.00008046169,0.2251622,0.008448356,0.04450142,0.7185656,0.0001459593],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004817981,0.003124603,0.547985,0.001370929,0.0007999708,0.001006844,0.07476336,0.2863003,0.07983097],"genre_scores_gemma":[0.04200236,0.006030254,0.6352809,0.001808883,0.0003604495,0.005466397,0.1578779,0.1102606,0.04091229],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.07880018,"threshold_uncertainty_score":0.2636128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03001465655743017,"score_gpt":0.2930303341303065,"score_spread":0.2630156775728764,"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."}}