{"id":"W2061568192","doi":"10.1007/s10589-011-9432-0","title":"An exact method with variable fixing for solving the generalized assignment problem","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Mathematical optimization; Simple (philosophy); Variable (mathematics); Weapon target assignment problem; Generalized assignment problem; Sequence (biology); Branch and cut; Branch and bound; Optimization problem; Augmented Lagrangian method; Lagrangian relaxation; Linear programming","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.001191243,0.0009988811,0.001070656,0.0008365565,0.0006266721,0.0006226339,0.00188789,0.001294647,0.005755316],"category_scores_gemma":[0.003767801,0.0005821954,0.00104928,0.001324291,0.0009808864,0.001134476,0.001431684,0.00221116,0.001048362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004775499,"about_ca_system_score_gemma":0.00134992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005086162,"about_ca_topic_score_gemma":0.00510211,"domain_scores_codex":[0.9993613,0.0002571586,0.00001942773,0.00008031647,0.0002283896,0.00005345115],"domain_scores_gemma":[0.9992788,0.0004272549,0.00003689241,0.0001096413,0.0001212531,0.00002606406],"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.0000841859,0.0001039011,0.0002465185,0.0002091044,0.00007271979,0.00009156498,0.00008857618,0.6519021,0.003114994,0.1440837,0.006070166,0.1939324],"study_design_scores_gemma":[0.00002571781,0.00002822215,0.00005482292,0.00001323179,0.00001108611,0.00002453676,0.000009640657,0.9683087,0.0004199183,0.02808221,0.00301112,0.00001077976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001299335,0.00008274531,0.9968711,0.00004758978,0.00007166619,0.00002179403,0.00002180299,0.00009105119,0.001493043],"genre_scores_gemma":[0.05260975,0.0002229641,0.9421155,0.0001394997,0.0001017682,0.0002423784,0.0001032314,0.0001872032,0.004277726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005755316,"threshold_uncertainty_score":0.01925343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02552492942574305,"score_gpt":0.2797806794497151,"score_spread":0.254255750023972,"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."}}