{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001073498,0.0004910781,0.0005543772,0.0004524882,0.0001221581,0.0002498693,0.0007137294,0.0003986834,0.00005936286],"category_scores_gemma":[0.0003473969,0.0004101135,0.0001307965,0.0002565069,0.0009707462,0.0001749651,0.0001376175,0.0005455647,0.00001268665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002863147,"about_ca_system_score_gemma":0.0003043524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001045172,"about_ca_topic_score_gemma":0.000007768117,"domain_scores_codex":[0.9974533,0.00002464269,0.0006563552,0.0007546999,0.0004260087,0.000684983],"domain_scores_gemma":[0.9978265,0.001076471,0.000147381,0.0004874456,0.0002895592,0.0001726176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003276538,0.00000816671,0.00001262694,0.0001580169,0.00002360511,0.000006880866,0.0002497373,0.2201367,0.0004720293,0.01293835,0.00000605345,0.7659845],"study_design_scores_gemma":[0.000521154,0.0001333943,0.000004202176,0.0008454445,0.0000195642,0.00003716965,5.060511e-7,0.9586427,0.001033059,0.03572357,0.002312704,0.0007265268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001521788,0.0001258765,0.9921907,0.000252069,0.001019725,0.001126289,0.0000244702,0.0004304266,0.004815224],"genre_scores_gemma":[0.05349481,0.00001401688,0.9455208,0.0002377363,0.0003860463,0.00005524583,0.000008741938,0.0000939537,0.0001886978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.765258,"threshold_uncertainty_score":0.9998351,"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."}}