{"id":"W2923556723","doi":"10.1016/j.disopt.2019.03.004","title":"Combinatorial optimization with interaction costs: Complexity and solvable cases","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Parameterized complexity; Combinatorial optimization; Matroid; Mathematics; Quadratic assignment problem; Diagonal; Combinatorics; Matrix (chemical analysis); Mathematical optimization; Intersection (aeronautics); Rank (graph theory); Optimization problem; Computational complexity theory; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.005029086,0.001936037,0.002869203,0.002115289,0.00162297,0.007898756,0.003946584,0.00464731,0.01603753],"category_scores_gemma":[0.04043695,0.001298664,0.002676274,0.004772198,0.003403615,0.008504356,0.003836203,0.006204652,0.0009446883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002869502,"about_ca_system_score_gemma":0.00230596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003140848,"about_ca_topic_score_gemma":0.002607384,"domain_scores_codex":[0.994221,0.002575626,0.0002384871,0.0006940922,0.001452339,0.0008185451],"domain_scores_gemma":[0.9553624,0.0392213,0.00176033,0.001916762,0.0009570091,0.0007822088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002403158,0.0003838169,0.001046036,0.0004048012,0.0001461558,0.0005227684,0.0001591831,0.1945505,0.000426544,0.7711115,0.009722346,0.02128602],"study_design_scores_gemma":[0.00007301324,0.00003432648,0.0002796338,0.00003267435,0.00004512191,0.0001775841,0.00007171988,0.4120455,0.0002444609,0.585277,0.001693035,0.00002587982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1492974,0.002233523,0.7184098,0.007861599,0.0002870639,0.0003558491,0.001398068,0.0003720684,0.1197847],"genre_scores_gemma":[0.8376357,0.001654226,0.1298507,0.0006441153,0.0009038901,0.0007495942,0.001094407,0.0003169,0.02715041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01603753,"threshold_uncertainty_score":0.05365086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0148475165915815,"score_gpt":0.239395156831513,"score_spread":0.2245476402399315,"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."}}