{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983651,0.001337071,0.0009466314,0.0008521687,0.0005055404,0.001962283,0.001649518,0.001271128,0.005110635],"category_scores_gemma":[0.003790606,0.0008241405,0.001468136,0.001279854,0.001102604,0.00275611,0.001974661,0.002980744,0.0005922751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341355,"about_ca_system_score_gemma":0.002207052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0027977,"about_ca_topic_score_gemma":0.004373634,"domain_scores_codex":[0.9989717,0.000364364,0.00004198067,0.0002218244,0.0002357179,0.0001643978],"domain_scores_gemma":[0.9978529,0.001468114,0.0001964423,0.0002434594,0.0001467582,0.00009237276],"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.00005791465,0.0001129687,0.0003924879,0.0001508803,0.00004284747,0.00005849393,0.00006371596,0.8706782,0.001604121,0.07360294,0.001839005,0.05139643],"study_design_scores_gemma":[0.0000158129,0.00003239099,0.00004293164,0.00001932458,0.000007237781,0.00001838023,0.00002316284,0.9608318,0.0008900416,0.03664516,0.001467196,0.000006679613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008035565,0.0001544264,0.9879082,0.0002327984,0.00002588763,0.00005255123,0.00009084021,0.000218296,0.003281524],"genre_scores_gemma":[0.2290608,0.0005076832,0.7642781,0.0002481965,0.00007565763,0.0003600686,0.0005204182,0.0002704517,0.004678741],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005110635,"threshold_uncertainty_score":0.01709676,"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."}}