{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001249623,0.0001340222,0.0001314243,0.0001000047,0.0001292293,0.0004940979,0.0002393721,0.00003706784,0.00008537112],"category_scores_gemma":[0.0000177969,0.0001171226,0.00001702438,0.0003062956,0.00004011503,0.002565645,0.0001802842,0.0000704629,0.00001615947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005710165,"about_ca_system_score_gemma":0.00001674526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007948567,"about_ca_topic_score_gemma":0.000005669909,"domain_scores_codex":[0.9990652,0.00004635282,0.0001526732,0.0003610928,0.0002095226,0.0001652174],"domain_scores_gemma":[0.999366,0.00003907188,0.0001216511,0.0003280105,0.00009191054,0.00005333994],"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.0000533781,0.00004902344,0.0010999,0.00002379565,0.00002508998,0.000006064646,0.00009222897,0.9061905,0.000006719705,0.09039252,0.0002388433,0.00182198],"study_design_scores_gemma":[0.0007985167,0.0001860358,0.000148212,0.00003389612,0.00001198824,0.00001025528,0.00009641975,0.997822,0.00004326311,0.0002168895,0.0004554027,0.000177078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002153324,0.00001729327,0.9892972,0.0002386199,0.0005798664,0.0003635479,0.000008628362,0.0001455233,0.007196018],"genre_scores_gemma":[0.5039415,0.00009309174,0.4945109,0.0001922899,0.0001004843,0.0000252373,0.0007411702,0.00002667844,0.0003685645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5017882,"threshold_uncertainty_score":0.4776119,"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."}}