{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001470361,0.001213128,0.001081935,0.0009414272,0.0006073759,0.001495664,0.0008570685,0.0008789373,0.007492567],"category_scores_gemma":[0.005042004,0.0005963868,0.001157238,0.0009065419,0.001260554,0.001625076,0.001306365,0.00237608,0.001060867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002215146,"about_ca_system_score_gemma":0.002247363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004208554,"about_ca_topic_score_gemma":0.00373906,"domain_scores_codex":[0.9991204,0.0003299139,0.00002970509,0.0001289253,0.0002410532,0.0001500192],"domain_scores_gemma":[0.9985242,0.0009493403,0.0001167994,0.0001140738,0.0002310147,0.00006458463],"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.00005114898,0.00003637987,0.0002516585,0.000174827,0.00002552699,0.00005142238,0.00007089139,0.7616774,0.001458252,0.2024931,0.003876723,0.02983266],"study_design_scores_gemma":[0.00001282816,0.00001719014,0.00007538675,0.00002825639,0.000007383165,0.00001326547,0.00001453779,0.9024886,0.0004718331,0.09471925,0.002144046,0.000007510326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005638027,0.0002563118,0.9844474,0.0002004765,0.0000399997,0.00005425436,0.0001055223,0.0001271337,0.009130887],"genre_scores_gemma":[0.229653,0.0005885208,0.7611216,0.0002298609,0.00008346236,0.0004260564,0.0004520029,0.0004427701,0.007002685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007492567,"threshold_uncertainty_score":0.02506512,"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."}}