{"id":"W2095153636","doi":"10.1287/ijoc.2013.0568","title":"The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematical optimization; Heuristics; Benders' decomposition; Mathematics; Generalization; Tabu search; Quadratic programming; Context (archaeology); Minimax; Heuristic; Quadratic equation; Interval (graph theory); Computer science; Combinatorics","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.00260012,0.001211548,0.001111788,0.0005728244,0.0004553597,0.001384321,0.001641886,0.001374626,0.003657211],"category_scores_gemma":[0.006759182,0.00047972,0.0008718328,0.001050354,0.0009078446,0.001734041,0.001168784,0.001498046,0.0006196762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009032127,"about_ca_system_score_gemma":0.001178567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001545554,"about_ca_topic_score_gemma":0.0009534922,"domain_scores_codex":[0.9984728,0.0006054128,0.00005234379,0.0003226196,0.0003676527,0.0001792148],"domain_scores_gemma":[0.9981199,0.001033278,0.0003553962,0.0002264042,0.0001643347,0.0001006317],"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.0001017462,0.00006407704,0.0001916312,0.00008484417,0.00002702465,0.00006786751,0.00003595315,0.9513215,0.001344915,0.02207338,0.001038565,0.02364851],"study_design_scores_gemma":[0.00001769938,0.00007476544,0.0001290493,0.000008830295,0.000009043217,0.00004340086,0.00001466391,0.9805996,0.001106984,0.01709878,0.0008885279,0.000008628817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02231086,0.0001720937,0.974058,0.0001820807,0.0000313961,0.00004540381,0.0001441147,0.0001827442,0.002873302],"genre_scores_gemma":[0.5470673,0.000478867,0.4456654,0.0001637544,0.0001703894,0.0002259989,0.0005597167,0.0002039809,0.005464545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003657211,"threshold_uncertainty_score":0.01375091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009813052214419407,"score_gpt":0.1979250448395075,"score_spread":0.1881119926250881,"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."}}