{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","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.0008464135,0.0002495897,0.0003612819,0.00009982859,0.0003531442,0.0005052782,0.0008648384,0.00009540441,0.00002833833],"category_scores_gemma":[0.0003773208,0.0002120832,0.0002627222,0.0005743382,0.0001821734,0.0003782339,0.0003514878,0.0002098573,0.00006772232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004438559,"about_ca_system_score_gemma":0.00004099591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006711507,"about_ca_topic_score_gemma":0.000005037024,"domain_scores_codex":[0.997776,0.00004867554,0.0004885723,0.0005559212,0.00038226,0.0007485403],"domain_scores_gemma":[0.9983942,0.0004597155,0.0001195626,0.0006679401,0.0001280671,0.0002305048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006884758,0.0003801981,0.0001251298,0.000142057,0.00002203584,0.00002001806,0.0004339933,0.000004197506,0.0000372753,0.2981881,0.00008590671,0.7005543],"study_design_scores_gemma":[0.0009956042,0.0004870931,0.00008759776,0.0001853386,0.00003948204,0.0002063179,0.0002027361,0.2951645,0.0005886141,0.4161063,0.2851992,0.0007372833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004875361,0.00007936033,0.9910973,0.001034391,0.000198956,0.001120478,0.000001807976,0.0006898055,0.0009025519],"genre_scores_gemma":[0.1069741,0.000003595394,0.892061,0.0001308927,0.0001725874,0.0003461844,0.000005545884,0.00002426617,0.0002818247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6998169,"threshold_uncertainty_score":0.8648503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04709839733559648,"score_gpt":0.3024123968041444,"score_spread":0.2553139994685479,"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."}}