{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001098025,0.0003265296,0.0005138793,0.000151737,0.0003002736,0.00021396,0.0004046592,0.0001718318,0.0002764963],"category_scores_gemma":[0.003233358,0.0002897106,0.0002326179,0.0003994654,0.0001895966,0.000311622,0.000152627,0.0003030912,0.0001998764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000173066,"about_ca_system_score_gemma":0.00006980983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.302417e-7,"about_ca_topic_score_gemma":0.000005954297,"domain_scores_codex":[0.9970057,0.0000713531,0.000784331,0.0004963445,0.0006166788,0.001025586],"domain_scores_gemma":[0.9971573,0.001499133,0.0002010776,0.0005315829,0.0003157696,0.0002951045],"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.00003514439,0.0007814572,0.00001057661,0.0007734984,0.00007887822,0.000005711976,0.0006329665,0.0001268925,0.00007196245,0.2450929,0.00128172,0.7511083],"study_design_scores_gemma":[0.002871394,0.000379227,0.000003077397,0.0003190445,0.0001399836,0.00008555839,0.0009038004,0.1814797,0.003101933,0.4314977,0.3782022,0.001016436],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001692112,0.0001027844,0.9917245,0.001056002,0.00007200777,0.002863476,0.000005982484,0.0007029061,0.00178025],"genre_scores_gemma":[0.01914071,0.000004692783,0.9756967,0.00006195719,0.0002874973,0.001320111,0.00001678548,0.0001268683,0.003344632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7500919,"threshold_uncertainty_score":0.9999555,"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."}}