{"id":"W2022150528","doi":"10.1007/s10288-004-0057-3","title":"Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Bounding overwatch; Mathematical optimization; CONTEST; Polarization (electrochemistry); Frequency assignment; Computer science; Assignment problem; Mathematics; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001869252,0.00007183722,0.000053681,0.00004213186,0.0002548699,0.0002223914,0.0001201724,0.00002775172,0.00004124876],"category_scores_gemma":[0.00002391882,0.00004725605,0.00001322167,0.0001281838,0.00009820744,0.0003462755,0.00002575276,0.00005772662,0.000003582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003968567,"about_ca_system_score_gemma":0.0001363034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006096963,"about_ca_topic_score_gemma":0.00004936074,"domain_scores_codex":[0.9993896,0.00001680121,0.0001033862,0.0001867351,0.000154344,0.0001491053],"domain_scores_gemma":[0.999652,0.00006883425,0.00004212296,0.0001196996,0.00007372753,0.00004363278],"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.00003214371,0.0001073306,0.02138111,0.0000892559,0.0000709816,0.000002563286,0.00309596,0.004937509,0.005470413,0.3223723,0.0004277435,0.6420127],"study_design_scores_gemma":[0.005160218,0.00106732,0.08774534,0.0003764957,0.00009784988,0.0003710086,0.001105778,0.877745,0.00743582,0.006758037,0.01088126,0.001255893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003899344,0.00004931876,0.9898759,0.004599002,0.00006099281,0.0005740146,0.00000295364,0.00006038907,0.0008780576],"genre_scores_gemma":[0.8553477,0.00001236139,0.1440745,0.0002697993,0.00004348686,0.00004304045,0.000002502656,0.000005247887,0.0002013411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8728074,"threshold_uncertainty_score":0.2144526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01363488760412227,"score_gpt":0.2470552419651835,"score_spread":0.2334203543610613,"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."}}