{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808008,0.001200295,0.00100591,0.001263944,0.000986885,0.001150287,0.001507481,0.001274748,0.01337676],"category_scores_gemma":[0.004776143,0.0008858467,0.001549673,0.001349718,0.0006676768,0.001697431,0.002017077,0.002816187,0.003265357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003909908,"about_ca_system_score_gemma":0.001657909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001322005,"about_ca_topic_score_gemma":0.001895153,"domain_scores_codex":[0.9989216,0.0004041764,0.00005786284,0.000114139,0.0004031386,0.00009915902],"domain_scores_gemma":[0.9986499,0.0007475996,0.00005979679,0.000178079,0.0003161727,0.0000484566],"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.0004735805,0.0006142831,0.0004205702,0.0005668821,0.0001152801,0.0001892451,0.0002311019,0.1965106,0.02462616,0.1926452,0.01386648,0.5697407],"study_design_scores_gemma":[0.0001916965,0.0001855821,0.0002079424,0.0000446616,0.00003785392,0.000134228,0.00003666787,0.9100893,0.009583989,0.06209563,0.0173416,0.00005079588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008758274,0.0000266579,0.996603,0.00005192642,0.00004003718,0.00009483875,0.00002683937,0.000243933,0.002036861],"genre_scores_gemma":[0.02718391,0.00006671299,0.9681834,0.0001010838,0.00004254624,0.0003996669,0.0001369946,0.0003332013,0.003552496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01337676,"threshold_uncertainty_score":0.04474974,"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."}}