{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832537,0.0001160725,0.000191171,0.0001056607,0.0003327312,0.00001520462,0.0006156683,0.0001065768,0.0004484942],"category_scores_gemma":[0.001188998,0.00007577103,0.0001001361,0.0004506249,0.0006536814,0.0002394829,0.0003072831,0.0001429512,0.00003482081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001680095,"about_ca_system_score_gemma":0.00009295862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006330668,"about_ca_topic_score_gemma":0.00003140698,"domain_scores_codex":[0.9986633,0.0001188066,0.0002180994,0.0002550487,0.0004521167,0.0002926106],"domain_scores_gemma":[0.9974483,0.001363747,0.0001478886,0.0005885518,0.0003371269,0.0001144076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002145578,0.001762177,0.001343383,0.0003240654,0.0004073956,0.0001542288,0.0009663851,0.03695714,0.02882852,0.6451963,0.05944415,0.2224707],"study_design_scores_gemma":[0.0248434,0.002536622,0.003099786,0.001300174,0.0005878715,0.0001559822,0.00498151,0.1248241,0.02712309,0.4736944,0.3327925,0.004060581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002470955,0.00003319273,0.9892319,0.002289656,0.00004197883,0.0003860421,0.00002347822,0.0002099589,0.005312839],"genre_scores_gemma":[0.2537363,0.001433724,0.72148,0.00004310641,0.00006761347,0.000002814027,0.000009605877,0.00007315893,0.02315374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2733483,"threshold_uncertainty_score":0.4910697,"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."}}