{"id":"W4205439189","doi":"10.17771/pucrio.acad.51356","title":"THE MULTI-PERIOD PRIZE-COLLECTING STEINER TREE PROBLEM WITH BUDGET CONSTRAINTS","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Steiner tree problem; Benchmark (surveying); Period (music); Combinatorics; Tree (set theory); Revenue; Time horizon; Mathematics; Mathematical optimization; Computer science; Geography; Economics; Cartography; Physics","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.001285567,0.0008823214,0.001145369,0.0005382528,0.0006357657,0.001442712,0.001648321,0.001253802,0.006126191],"category_scores_gemma":[0.002483161,0.0004602533,0.0008710141,0.001603591,0.0004754689,0.002964765,0.0008691492,0.001128244,0.0004618748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161619,"about_ca_system_score_gemma":0.001323341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001249539,"about_ca_topic_score_gemma":0.001794554,"domain_scores_codex":[0.9991832,0.0003384121,0.00003440101,0.0001571787,0.0001030879,0.0001837556],"domain_scores_gemma":[0.9990041,0.0005377195,0.0001255041,0.0001088661,0.0000718531,0.0001520517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005519527,0.0002730779,0.001033313,0.0006809449,0.0001470415,0.0004428248,0.0001806489,0.7572864,0.003432284,0.1284298,0.01240841,0.09513329],"study_design_scores_gemma":[0.0001106768,0.0003267287,0.001451547,0.00008955516,0.00008610104,0.0005516363,0.0002153531,0.8481503,0.002313662,0.1296796,0.01698363,0.00004123513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2093726,0.001871608,0.751079,0.001661624,0.0002933369,0.0004518997,0.002679687,0.0004577042,0.03213257],"genre_scores_gemma":[0.7768109,0.001625663,0.2048443,0.0001549812,0.0001469429,0.0003796979,0.001190401,0.0002271773,0.01461995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006126191,"threshold_uncertainty_score":0.02049416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01859464823067754,"score_gpt":0.257944092199948,"score_spread":0.2393494439692704,"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."}}