{"id":"W7010878198","doi":"","title":"A Lagrangian relaxation technique for the demand-based benefit maximization problem","year":2018,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Intersection (aeronautics); Constraint (computer-aided design); Term (time); Filter (signal processing); Work (physics); Maximization","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237688,0.001937556,0.001162569,0.0008054939,0.0005408268,0.001413349,0.001190552,0.001448417,0.007849164],"category_scores_gemma":[0.003635683,0.0007718303,0.001917137,0.001291664,0.001140378,0.001655403,0.002036233,0.004944707,0.001915244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297816,"about_ca_system_score_gemma":0.00226996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731554,"about_ca_topic_score_gemma":0.002544712,"domain_scores_codex":[0.9988056,0.0005741529,0.00004808481,0.0001509065,0.000301774,0.0001194271],"domain_scores_gemma":[0.9988375,0.0008002912,0.00009167683,0.00007067581,0.0001517744,0.00004803263],"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.00006154191,0.0001598794,0.0002773,0.0005353132,0.00007314544,0.0002993672,0.0002435335,0.6699632,0.003429184,0.2562204,0.01520424,0.05353291],"study_design_scores_gemma":[0.00003689795,0.00007375555,0.0001214009,0.0001005628,0.00002348743,0.0001247324,0.00005651895,0.9197341,0.0007763057,0.06121906,0.01771102,0.000022108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009116278,0.0003106948,0.9906567,0.0004410619,0.00006519781,0.00007511296,0.0001124676,0.00005349796,0.007373531],"genre_scores_gemma":[0.104523,0.001594314,0.8802084,0.0005964839,0.0003198722,0.001009887,0.0005404857,0.0002572241,0.01095029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007849164,"threshold_uncertainty_score":0.02625805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01814137652884961,"score_gpt":0.2450526152364405,"score_spread":0.2269112387075908,"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."}}