{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009028257,0.0002380729,0.0002263986,0.0001642776,0.0001532994,0.0001045936,0.0009342036,0.000106843,0.00004781926],"category_scores_gemma":[0.00006400189,0.0001400258,0.00005314,0.0002841179,0.0007654987,0.00006816859,0.0002299708,0.0007798217,0.00001222015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008563806,"about_ca_system_score_gemma":0.0001087415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297986,"about_ca_topic_score_gemma":0.00003740687,"domain_scores_codex":[0.9986291,0.00002828724,0.0002653194,0.000284019,0.0005226074,0.0002706522],"domain_scores_gemma":[0.9988104,0.0003922193,0.00008133048,0.0005372948,0.0001259912,0.0000527496],"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.000001784348,0.00000364486,0.000006057337,0.00003780566,0.00000760031,0.000001074203,0.0007261406,0.9391982,0.00002189348,0.0352346,0.00003831583,0.02472291],"study_design_scores_gemma":[0.00007301188,0.0000429144,0.000009838258,0.0002871416,0.000003439263,0.00000482497,3.199798e-7,0.8707517,0.0002269531,0.1273362,0.001098381,0.0001652644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007213849,0.0001817959,0.9761319,0.0007666111,0.0004755489,0.0003306797,0.00000627371,0.00009722428,0.02193786],"genre_scores_gemma":[0.8756199,0.00005784194,0.1228893,0.0006903532,0.0003863383,0.000009617749,0.00000854648,0.00008989943,0.000248229],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8755478,"threshold_uncertainty_score":0.5710086,"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."}}