{"id":"W6891507486","doi":"10.4230/lipics.cp.2024.32","title":"Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Dynamic programming; Constraint (computer-aided design); Exploit; Integer programming; Set (abstract data type); State (computer science); Construct (python library); Variable (mathematics); Dimension (graph theory)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004685775,0.0005238577,0.0004312423,0.0003178334,0.0002236239,0.001026949,0.0002396233,0.000227905,0.00001174828],"category_scores_gemma":[0.00001787846,0.0004485768,0.0001158643,0.0003245874,0.0001332238,0.001216281,0.0001244805,0.0005345017,0.00002797644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002628369,"about_ca_system_score_gemma":0.0000676939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005550926,"about_ca_topic_score_gemma":0.00006149999,"domain_scores_codex":[0.9974387,0.00001549564,0.0009060461,0.0003173118,0.0004266967,0.0008957711],"domain_scores_gemma":[0.9990945,0.00008116739,0.0001361177,0.0003440401,0.0001391024,0.0002051148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002806988,0.0005814345,0.02739752,0.04417381,0.003221087,0.0002200573,0.103161,0.1495528,0.00159715,0.009078521,0.001047597,0.6596884],"study_design_scores_gemma":[0.002162428,0.0003603707,0.0003503714,0.002055093,0.0001433383,0.0005176335,0.004906683,0.9421352,0.0002154703,0.0001549767,0.04593888,0.001059571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2304653,0.0004735787,0.7613409,0.0001446483,0.0007643322,0.003239458,0.0001371395,0.001811948,0.001622698],"genre_scores_gemma":[0.8648788,0.00004289049,0.1339549,0.00004717833,0.00009364083,0.0003699933,0.0003592819,0.0001592918,0.00009401466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7925824,"threshold_uncertainty_score":0.9997966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006743633718957348,"score_gpt":0.2110250786141874,"score_spread":0.2042814448952301,"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."}}