{"id":"W2132896555","doi":"10.1007/978-3-642-30850-5_8","title":"Compact Relaxations for Polynomial Programming Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Relaxation (psychology); Extension (predicate logic); Mathematical optimization; Computer science; Quadratic programming; Constraint programming; Integer programming; Constraint (computer-aided design); Polynomial; Regular polygon; Constraint satisfaction; Linear programming; Class (philosophy); Linear inequality; Quadratic equation; Convex optimization; Mathematics; Stochastic programming; Inequality; Nonlinear system; Programming language; Artificial intelligence","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.001310577,0.001697339,0.001257733,0.00103602,0.000685138,0.002222865,0.001512204,0.0009854927,0.01570028],"category_scores_gemma":[0.004832007,0.001017626,0.001016681,0.002571552,0.001369998,0.004352078,0.002042145,0.007279857,0.003469426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181871,"about_ca_system_score_gemma":0.0006095963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007739806,"about_ca_topic_score_gemma":0.001010002,"domain_scores_codex":[0.9991768,0.0002718511,0.00004697476,0.000100939,0.0003468616,0.00005666384],"domain_scores_gemma":[0.9987038,0.0008416896,0.00008938893,0.0001744408,0.0001297786,0.00006087802],"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.00009031154,0.0001058566,0.00006048619,0.0005550676,0.00002882789,0.00005318223,0.0002257193,0.02921177,0.001522642,0.7945561,0.02585794,0.1477321],"study_design_scores_gemma":[0.00004697524,0.00004745981,0.0001094595,0.0001887474,0.00001710537,0.00009495507,0.00007496786,0.0694842,0.0005420373,0.8665794,0.06279854,0.00001624933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006838217,0.01253826,0.8753415,0.00240527,0.0007769197,0.000131393,0.0004703005,0.0003939737,0.1011042],"genre_scores_gemma":[0.2106583,0.02476705,0.657537,0.001345608,0.003057097,0.001360813,0.002604642,0.001366745,0.09730264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01570028,"threshold_uncertainty_score":0.05252266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06770075026149787,"score_gpt":0.3496963925889923,"score_spread":0.2819956423274944,"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."}}