{"id":"W2108687116","doi":"10.1007/978-3-540-85958-1_32","title":"Exploiting Decomposition in Constraint Optimization Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; Bounding overwatch; Search tree; Recursion (computer science); Component (thermodynamics); Decomposition; Mathematical optimization; Tree (set theory); Decomposition method (queueing theory); Tree decomposition; Constraint (computer-aided design); Branch and bound; Depth-first search; Algorithm; Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence","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.001628791,0.001463433,0.001204623,0.001172831,0.0004729292,0.001711298,0.001241205,0.0007933642,0.00722636],"category_scores_gemma":[0.005410904,0.001040346,0.001650469,0.002882817,0.0009384383,0.002760847,0.002636217,0.003765106,0.001649561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006478312,"about_ca_system_score_gemma":0.0008535432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521767,"about_ca_topic_score_gemma":0.002104714,"domain_scores_codex":[0.9986922,0.0005825171,0.00006444831,0.0001389028,0.0004277781,0.00009418958],"domain_scores_gemma":[0.9981127,0.001274364,0.00008375935,0.0002949032,0.0001752106,0.00005902633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001272574,0.0001605173,0.0003890337,0.0007053526,0.0001579011,0.0001707881,0.0001820485,0.1602598,0.005229739,0.4040647,0.0233451,0.4052078],"study_design_scores_gemma":[0.00003152878,0.00003231705,0.0001365058,0.0001285192,0.00004301655,0.0001141797,0.00003731366,0.4972478,0.001866335,0.4743512,0.02599188,0.0000193511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002012543,0.0009564176,0.9862658,0.0002519329,0.00008268945,0.00004202865,0.0000874962,0.0002299917,0.01007113],"genre_scores_gemma":[0.0619323,0.001977126,0.9280244,0.0002190154,0.0001766764,0.0001645162,0.0006435256,0.0003728926,0.006489555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00722636,"threshold_uncertainty_score":0.02417457,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.017851611222919,"score_gpt":0.2407546221978134,"score_spread":0.2229030109748944,"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."}}