{"id":"W3120609971","doi":"10.22215/etd/2014-10380","title":"Subadditive Approaches to Mixed Integer Programming","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Subadditivity; Mathematics; Integer programming; Knapsack problem; Linear programming; Integer (computer science); Linear programming relaxation; Duality (order theory); Discrete mathematics; Mathematical optimization; Combinatorics; Computer science","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.0003683551,0.0003540924,0.0004725538,0.0003606371,0.0001089498,0.0001094541,0.0003531685,0.0003165103,0.00083977],"category_scores_gemma":[0.001796626,0.0003119351,0.0001253859,0.00043121,0.00002774882,0.0001018541,0.00006065709,0.0004692202,0.0003529716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001310455,"about_ca_system_score_gemma":0.0001048476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009487962,"about_ca_topic_score_gemma":0.0003544594,"domain_scores_codex":[0.9978673,0.0001024974,0.0004290768,0.0005478603,0.0006075441,0.0004456879],"domain_scores_gemma":[0.9983332,0.0004844111,0.0001848458,0.0004410909,0.0003487565,0.0002077635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003007585,0.0006443017,0.00001380295,0.001886707,0.0004016887,0.0000184993,0.00722939,0.0008632514,0.00003319993,0.312359,0.0443171,0.6319323],"study_design_scores_gemma":[0.004645594,0.001744607,0.0003304804,0.0033226,0.0007342352,0.00003544909,0.08939509,0.1000168,0.04952816,0.2992261,0.4410509,0.009969883],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006833592,0.00002576047,0.880108,0.0001875458,0.0004374222,0.002164662,0.00002009994,0.0004240164,0.1159491],"genre_scores_gemma":[0.003153478,0.000006568667,0.7558784,0.00004861756,0.0002358693,0.0009325544,0.001548869,0.0001963902,0.2379992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6219624,"threshold_uncertainty_score":0.9999333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2000307554030832,"score_gpt":0.3763119452720022,"score_spread":0.176281189868919,"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."}}