{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226595,0.000159981,0.0001282052,0.00005479816,0.0003684157,0.0003801708,0.0001818098,0.00004012822,0.00001798819],"category_scores_gemma":[0.00003190775,0.0000861556,0.00003869606,0.00007153134,0.00002661968,0.0002733879,0.00002899307,0.0004740218,0.0000441818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001505578,"about_ca_system_score_gemma":0.00001811446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003145513,"about_ca_topic_score_gemma":0.000003281838,"domain_scores_codex":[0.9990278,0.00001139888,0.0003589052,0.00007444036,0.0002256663,0.0003017507],"domain_scores_gemma":[0.9994308,0.0001300634,0.0001333661,0.0001374019,0.00007670394,0.00009167742],"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.000006868883,0.00000531712,0.00002573974,0.00001388805,0.00002911876,0.000004193486,0.0002257393,0.9506029,0.000005870112,0.0002441137,0.0006996903,0.04813655],"study_design_scores_gemma":[0.0003261703,0.0001958466,0.0002044645,0.0002109866,0.0000077392,0.0001199086,0.0002510407,0.9946387,0.0002486165,0.000879075,0.002735295,0.0001821684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03558186,0.00004786954,0.9581032,0.000143346,0.0003218309,0.0001941155,2.966248e-7,0.0001712058,0.005436289],"genre_scores_gemma":[0.9410164,0.0000318076,0.05845714,0.00007461505,0.0002001315,0.000005521927,0.000001741391,0.0000265152,0.0001861587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9054345,"threshold_uncertainty_score":0.3665996,"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."}}