{"id":"W2966782683","doi":"10.1609/icaps.v29i1.3496","title":"Lagrangian Decomposition for Optimal Cost Partitioning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"European Commission","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristics; Solver; Computation; Computer science; Context (archaeology); Heuristic; Lagrange multiplier; Decomposition; Mathematics; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978992,0.0001176078,0.0001404788,0.00008241752,0.0002080118,0.0003627644,0.0005230018,0.00006256599,0.000003925227],"category_scores_gemma":[0.0002379846,0.0001013352,0.00005560066,0.0001572623,0.00003612772,0.0002956403,0.0001494907,0.0001478014,0.000001966233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000321605,"about_ca_system_score_gemma":0.00006911793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003269836,"about_ca_topic_score_gemma":9.703305e-8,"domain_scores_codex":[0.999002,0.000008368741,0.0002349252,0.0002942069,0.0002822732,0.0001781619],"domain_scores_gemma":[0.9990083,0.00009759625,0.0002020906,0.00008164864,0.0005571964,0.00005318555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001484374,0.0002450418,0.02009919,0.0002186636,0.0003578211,0.00002492393,0.004606542,0.118666,0.2423797,0.6040395,0.001633615,0.007580576],"study_design_scores_gemma":[0.0003309886,0.00003738117,0.002856263,0.00064114,0.00001021897,0.00006412796,0.0002391015,0.9524232,0.04187812,0.001342111,0.00006040413,0.0001169339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7654353,0.0001035756,0.2179638,0.007923576,0.001178162,0.0003456443,0.00003080777,0.000709592,0.006309574],"genre_scores_gemma":[0.7805972,0.000004029566,0.2190872,0.0001634438,0.00004461785,0.00002017227,0.00001047397,0.000006277229,0.00006666305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8337572,"threshold_uncertainty_score":0.4132331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04611523053097789,"score_gpt":0.323265699325086,"score_spread":0.2771504687941081,"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."}}