{"id":"W2603318542","doi":"","title":"Polynomially Solvable Cases of the Constant Rank Unconstrained Quadratic 0-1 Programming Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic programming; Quadratic equation; Quadratic function; Matrix (chemical analysis); Function (biology); Mathematical optimization; Computer science; Geometry","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.001417019,0.001282359,0.001334383,0.0005447387,0.0006240139,0.001930996,0.001301495,0.002146362,0.008364468],"category_scores_gemma":[0.008218239,0.0003852428,0.000615159,0.001015062,0.001662037,0.001880633,0.001365192,0.002344077,0.0006606646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008920888,"about_ca_system_score_gemma":0.0009427839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002721086,"about_ca_topic_score_gemma":0.002716199,"domain_scores_codex":[0.9983996,0.0005893509,0.000047954,0.0003562239,0.0002906388,0.0003162635],"domain_scores_gemma":[0.9963936,0.002677497,0.0004051819,0.0001693226,0.0001969511,0.0001574964],"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.000540802,0.0002720832,0.0008537238,0.0007149863,0.0000788895,0.001209239,0.0001942291,0.4363253,0.001691652,0.5015815,0.01830484,0.03823279],"study_design_scores_gemma":[0.0001232263,0.00011297,0.0003347022,0.00003494091,0.00001615364,0.0002208944,0.0001035199,0.6758071,0.0009425057,0.3193078,0.002963603,0.00003259526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1669762,0.002558972,0.7521533,0.003643737,0.0004458211,0.000183884,0.001371108,0.0005992157,0.07206786],"genre_scores_gemma":[0.8825403,0.0007496685,0.09355021,0.0004416841,0.0005159575,0.0001942345,0.0009890633,0.000256944,0.02076183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008364468,"threshold_uncertainty_score":0.02798194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0194214988598456,"score_gpt":0.2746901866794111,"score_spread":0.2552686878195655,"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."}}