{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; 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.002384134,0.001780634,0.001263398,0.002006775,0.001462884,0.003370384,0.001882965,0.001529153,0.008260891],"category_scores_gemma":[0.007855499,0.0009684708,0.0009459588,0.002250969,0.002402697,0.003473814,0.002206924,0.005295396,0.0009087261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131881,"about_ca_system_score_gemma":0.0009717473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133038,"about_ca_topic_score_gemma":0.002995015,"domain_scores_codex":[0.9986205,0.0005855392,0.0000519217,0.0001854852,0.0004149719,0.0001415938],"domain_scores_gemma":[0.9978492,0.001371582,0.0001879436,0.0001543166,0.0002568231,0.0001801457],"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.00008053933,0.000034317,0.000164778,0.0001121331,0.00002138821,0.00003404144,0.00008830857,0.02145333,0.000638295,0.9395847,0.004360306,0.03342786],"study_design_scores_gemma":[0.00001703415,0.00002601104,0.0001194794,0.00003416329,0.0000110366,0.00003885889,0.0000277081,0.06315036,0.0002795394,0.9316743,0.004611312,0.00001029871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0294543,0.00146441,0.9180783,0.001033976,0.0003357121,0.0001078295,0.0003085595,0.0002751518,0.04894189],"genre_scores_gemma":[0.3488433,0.001699496,0.5943332,0.0008293212,0.0006826866,0.0005993256,0.001144672,0.0005879787,0.05127991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008260891,"threshold_uncertainty_score":0.0276354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07451220809616238,"score_gpt":0.3946342440206426,"score_spread":0.3201220359244802,"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."}}