{"id":"W2134648168","doi":"10.1287/msom.1100.0302","title":"An Improved Dynamic Programming Decomposition Approach for Network Revenue Management","year":2010,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Dynamic programming; Decomposition; Revenue management; Bellman equation; Heuristic; Computer science; Revenue; Nonlinear programming; Nonlinear system; Function (biology); Mathematics; Economics","routes":{"ca_aff":true,"ca_fund":true,"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.001476428,0.001302693,0.000942445,0.0007996343,0.0003614231,0.001139506,0.001193654,0.000947712,0.003621386],"category_scores_gemma":[0.002538904,0.0006130619,0.001194791,0.0009980962,0.0007363991,0.001536902,0.001311398,0.002108876,0.0007400849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297324,"about_ca_system_score_gemma":0.00148556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003228854,"about_ca_topic_score_gemma":0.002592692,"domain_scores_codex":[0.9991063,0.0004195137,0.00002316935,0.0001066606,0.0002427077,0.0001015196],"domain_scores_gemma":[0.9994178,0.0003062645,0.00004922832,0.00005964205,0.000120867,0.00004628906],"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.00002189351,0.00004525643,0.0001139321,0.00005047729,0.00002398074,0.00004521467,0.00003054935,0.8978543,0.001277452,0.07628442,0.00145381,0.02279864],"study_design_scores_gemma":[0.000002537394,0.00000541076,0.00001372941,0.000003489254,0.000002324998,0.000006353934,0.000002321874,0.9919985,0.0001117303,0.007310046,0.000541338,0.000002322341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00180587,0.0001180661,0.9955791,0.00009710761,0.00002594202,0.00001616541,0.00002332054,0.00004087585,0.0022936],"genre_scores_gemma":[0.282349,0.0009271226,0.7073336,0.0002349738,0.0002122228,0.0003346569,0.0002233805,0.0002025461,0.008182527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003621386,"threshold_uncertainty_score":0.01211476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009026057899349026,"score_gpt":0.2433631331715402,"score_spread":0.2343370752721911,"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."}}