{"id":"W822479191","doi":"10.1007/978-3-319-16468-7_13","title":"On the Complexity of Searching the Linear Ordering Problem Neighborhoods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Initialization; Computer science; Time complexity; Process (computing); Data structure; Insert (composites); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001848197,0.001382739,0.002558973,0.001453801,0.001534916,0.004980183,0.003513755,0.002358716,0.02254575],"category_scores_gemma":[0.02193476,0.001231321,0.001801413,0.00392167,0.002236056,0.01032334,0.004021697,0.0051221,0.002284682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682815,"about_ca_system_score_gemma":0.001693554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005080649,"about_ca_topic_score_gemma":0.006047637,"domain_scores_codex":[0.9974501,0.0008790816,0.0001194424,0.0003829785,0.0008677875,0.0003006238],"domain_scores_gemma":[0.9832878,0.01424546,0.0005169107,0.00116228,0.0004683419,0.0003191928],"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.0009148956,0.0003984938,0.002113496,0.001094009,0.0001851503,0.0002800579,0.0005948629,0.2362525,0.002900738,0.4998027,0.05885797,0.1966051],"study_design_scores_gemma":[0.0001067314,0.000062491,0.0005964142,0.00009743682,0.00005765623,0.0001572556,0.0001532528,0.4067089,0.0007457554,0.5845873,0.006699836,0.00002684262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1674819,0.01062518,0.5977253,0.01364638,0.0008333157,0.0003847413,0.003141274,0.001403864,0.2047581],"genre_scores_gemma":[0.5487139,0.007803602,0.3878677,0.001385985,0.001307591,0.0007301801,0.003534525,0.001610624,0.04704595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02254575,"threshold_uncertainty_score":0.07542306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0601283905995073,"score_gpt":0.2651992792027599,"score_spread":0.2050708886032526,"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."}}