{"id":"W2790891482","doi":"10.1007/s12532-018-0147-4","title":"QPLIB: a library of quadratic programming instances","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Process Optimization and Integration","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Engineering and Physical Sciences Research Council; Bundesministerium für Bildung und Forschung","keywords":"Undecidable problem; Computer science; Quadratic programming; Variety (cybernetics); Integer programming; Selection (genetic algorithm); Quadratic equation; Combinatorial optimization; Class (philosophy); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Algorithm; Programming language; Artificial intelligence; Decidability","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.001110858,0.001630578,0.001455715,0.001332967,0.0006727929,0.00242961,0.003585406,0.00145046,0.04179859],"category_scores_gemma":[0.008860269,0.001137823,0.001620457,0.002844912,0.0005570294,0.002227088,0.001667724,0.003171691,0.01082984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007704283,"about_ca_system_score_gemma":0.002262366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004089947,"about_ca_topic_score_gemma":0.006108177,"domain_scores_codex":[0.9990903,0.0002513869,0.00007863951,0.0001444913,0.0003407154,0.00009444322],"domain_scores_gemma":[0.998347,0.0008933971,0.00008365775,0.0002976156,0.0003010549,0.00007722561],"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.0003791769,0.0003528199,0.0009089732,0.001693767,0.000177771,0.000196111,0.0001067277,0.3371553,0.001792614,0.1433523,0.2227762,0.2911083],"study_design_scores_gemma":[0.0001945352,0.00003895318,0.0001763358,0.00009320326,0.00003489707,0.0000943782,0.00002768764,0.8539919,0.002559113,0.08329414,0.05946204,0.00003285349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005110618,0.00074938,0.9310133,0.0006025069,0.0002645894,0.0002597956,0.00914865,0.02057157,0.03227964],"genre_scores_gemma":[0.07806848,0.0007764358,0.8868526,0.000337712,0.0001174173,0.0008462223,0.01249129,0.008898295,0.0116116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04179859,"threshold_uncertainty_score":0.1398302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0133077586837698,"score_gpt":0.2487562590210415,"score_spread":0.2354485003372717,"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."}}