{"id":"W1978157509","doi":"10.1016/s0898-1221(01)00264-4","title":"A two-phase optimization procedure for integer programming problems","year":2001,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical optimization; Integer programming; Mathematics; Nonlinear programming; Linear programming; Optimization problem; Integer (computer science); Simple (philosophy); Gradient descent; Nonlinear system; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001269639,0.000233487,0.0002448788,0.0001132455,0.0001560029,0.0001586791,0.0002152185,0.00006344348,0.00001829906],"category_scores_gemma":[0.00001815063,0.0002023291,0.0000617264,0.0004981019,0.00005692289,0.0001590858,0.00002595147,0.0001091593,0.00001731259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005128763,"about_ca_system_score_gemma":0.00002402871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.780113e-7,"about_ca_topic_score_gemma":0.000002158311,"domain_scores_codex":[0.9988922,0.00000556776,0.0003901508,0.0002395364,0.0001531452,0.0003193506],"domain_scores_gemma":[0.9991785,0.0001141798,0.00007118119,0.0003291162,0.0001680773,0.0001389917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000727772,0.0005606498,0.000005411465,0.001047859,0.00007541268,7.850922e-7,0.0008476853,0.9302746,0.00005308962,0.03256407,0.0003786152,0.03418454],"study_design_scores_gemma":[0.001136771,0.0000759649,1.889768e-7,0.000141897,0.00006044246,0.00004088991,0.0001758007,0.9808471,0.00005962461,0.002419191,0.01477825,0.0002639399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002170174,0.0000663821,0.9935702,0.0001290123,0.00003636932,0.003276049,0.000005173813,0.0009945902,0.001705219],"genre_scores_gemma":[0.02218382,0.0000243485,0.9733078,0.00004895987,0.00008404015,0.004082859,0.00009434446,0.00009076409,0.00008304969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05057243,"threshold_uncertainty_score":0.825074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01522489898792866,"score_gpt":0.2651034315614039,"score_spread":0.2498785325734752,"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."}}