{"id":"W2622615600","doi":"","title":"Lattice Preconditioning for the Real Relaxation Branch-and-Bound Approach for Integer Least Squares Problems","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Branch and bound; Bounding overwatch; Integer (computer science); Upper and lower bounds; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","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.001086415,0.0002347647,0.0002228631,0.0001511481,0.0006889771,0.0007592394,0.000728406,0.0001625211,0.00001169618],"category_scores_gemma":[0.0001966275,0.0001800102,0.0001333581,0.0002665528,0.0001021004,0.001098651,0.0001688588,0.0002280471,0.000005580811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001010716,"about_ca_system_score_gemma":0.00008133933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638338,"about_ca_topic_score_gemma":0.0001522721,"domain_scores_codex":[0.9983735,0.00009997852,0.0003656388,0.0004776812,0.0001826394,0.0005005662],"domain_scores_gemma":[0.9981258,0.0006827104,0.0002477264,0.0006224611,0.0001899726,0.0001313273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004734053,0.0001699418,0.001235912,0.0002303517,0.00008869253,4.391846e-7,0.001553039,0.006451089,0.001837157,0.8571787,0.002688746,0.1285185],"study_design_scores_gemma":[0.0004988507,0.0001619227,0.00636103,0.00003515397,0.00002903123,0.00003507823,0.0001342173,0.892625,0.001627397,0.09706835,0.001142126,0.0002818556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00902126,0.0005179608,0.9830428,0.00342501,0.0001295867,0.002918585,0.00002540855,0.0004335408,0.0004857886],"genre_scores_gemma":[0.595051,0.00007774046,0.3953711,0.000803741,0.0002427261,0.006884451,0.00003992331,0.00004159623,0.001487714],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8861739,"threshold_uncertainty_score":0.7340604,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01343966412486269,"score_gpt":0.2279116183280393,"score_spread":0.2144719542031766,"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."}}