{"id":"W2514584850","doi":"10.1007/978-3-319-44953-1_21","title":"Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Integer programming; Computer science; Heuristics; Constraint programming; Quadratically constrained quadratic program; Quadratic growth; Quadratic programming; Integer (computer science); Nonlinear programming; Mathematics; Algorithm; Stochastic programming; Nonlinear system","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.001494401,0.001876859,0.001269526,0.000538808,0.0004921669,0.002552862,0.001994101,0.001322116,0.01058291],"category_scores_gemma":[0.006610263,0.0009540447,0.001032439,0.002252422,0.001237555,0.002007098,0.001997826,0.003993651,0.002027491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320078,"about_ca_system_score_gemma":0.001456211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005309847,"about_ca_topic_score_gemma":0.003817577,"domain_scores_codex":[0.9985541,0.0005133705,0.0000762793,0.0002095792,0.0005322921,0.0001143396],"domain_scores_gemma":[0.9984866,0.001060634,0.00008454477,0.00009494508,0.0002241416,0.00004908298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000927375,0.0001020029,0.0001722249,0.001067607,0.0000716128,0.0001644528,0.0001442265,0.4672501,0.002688686,0.3415462,0.03053991,0.1561601],"study_design_scores_gemma":[0.00003147768,0.00003954033,0.0001242464,0.0001495482,0.0000178309,0.00006604454,0.0000299873,0.804567,0.0006748465,0.1751157,0.01915889,0.0000248616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001739182,0.001893151,0.9703879,0.000463177,0.0001928172,0.00006204874,0.0001977179,0.0001191523,0.02494492],"genre_scores_gemma":[0.1622519,0.01000937,0.7782288,0.0007914332,0.0008699517,0.0009471917,0.00175149,0.0009001363,0.04424979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01058291,"threshold_uncertainty_score":0.03540343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02049755106873633,"score_gpt":0.259341411781627,"score_spread":0.2388438607128907,"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."}}