{"id":"W7020944395","doi":"","title":"Modeling and solving combinatorial optimization problems with Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"other","venue":"DUGiMedia - Universitat de Girona","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Dynamic programming; Optimization problem; Combinatorial optimization; Stochastic programming; Constraint programming","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.00128223,0.001547562,0.0008397451,0.0005601627,0.0004230865,0.001932278,0.0009557656,0.001046732,0.006833631],"category_scores_gemma":[0.003671164,0.001014114,0.001078542,0.001228403,0.001350997,0.002539919,0.001356771,0.004070811,0.002070292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001179125,"about_ca_system_score_gemma":0.0009957406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004244015,"about_ca_topic_score_gemma":0.007600588,"domain_scores_codex":[0.9993355,0.0002251101,0.00002534104,0.0001256052,0.0002412903,0.00004723871],"domain_scores_gemma":[0.998706,0.000987995,0.00004308389,0.00008956747,0.0001116148,0.00006165783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000370179,0.00007874567,0.0005203672,0.0003665681,0.00008450184,0.00008837671,0.00009846101,0.2651856,0.001043358,0.4294672,0.09713283,0.205897],"study_design_scores_gemma":[0.00001773605,0.00002654321,0.0002371544,0.0001209075,0.00001924164,0.00006721439,0.00003585013,0.4258107,0.001261635,0.4280278,0.1443405,0.00003467187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001284897,0.006830633,0.9640848,0.004075376,0.0005885302,0.00002345516,0.000165745,0.0004495756,0.02249697],"genre_scores_gemma":[0.08139102,0.02043099,0.8311179,0.002167007,0.001793316,0.0002436528,0.0007464856,0.001000531,0.06110913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006833631,"threshold_uncertainty_score":0.02286083,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003513655480354783,"score_gpt":0.1938261172174521,"score_spread":0.1903124617370973,"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."}}