{"id":"W2115819683","doi":"10.1590/s0101-74382012005000005","title":"Accelerating benders decomposition with heuristicmaster problem solutions","year":2012,"lang":"en","type":"article","venue":"Pesquisa Operacional","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Montfort Hospital; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Benders' decomposition; Generality; Mathematical optimization; Decomposition; Computer science; Scheme (mathematics); Heuristic; Decomposition method (queueing theory); Algorithm; Mathematics; Discrete mathematics","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.0001204589,0.0001367594,0.00009632303,0.00006541939,0.0001961706,0.00007332443,0.00006724399,0.00004960099,0.0007519088],"category_scores_gemma":[0.000004265177,0.0001215582,0.0000277349,0.0001256914,0.00002607741,0.00042649,0.00002063189,0.0001412724,0.0001368539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005372664,"about_ca_system_score_gemma":0.00001618773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003266428,"about_ca_topic_score_gemma":0.00000796857,"domain_scores_codex":[0.9991907,0.00002115435,0.0001639315,0.0001077438,0.0001621626,0.0003542613],"domain_scores_gemma":[0.9996818,0.00002905289,0.00002063164,0.00009790253,0.0000532741,0.0001173719],"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.00001823023,0.0001275327,0.008899559,0.00009190767,0.00008686327,0.000001791355,0.001980495,0.9633502,0.001925085,0.01653664,0.00411451,0.002867196],"study_design_scores_gemma":[0.00287555,0.0002332054,0.02190436,0.0003909657,0.0001573085,0.0004796133,0.0006673007,0.8830364,0.002820502,0.0003750753,0.08485535,0.002204312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1854298,0.001261879,0.6396037,0.001406591,0.001610192,0.001050767,0.00009281379,0.001750953,0.1677933],"genre_scores_gemma":[0.9526069,0.00001122061,0.0466702,0.0001329735,0.0002190016,0.00004001439,0.0001075561,0.00003342221,0.0001787229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.767177,"threshold_uncertainty_score":0.8232874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02978486250149506,"score_gpt":0.2427013799541104,"score_spread":0.2129165174526153,"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."}}