{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":15,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":15,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e35e17daf8d4","filters":{"venue":"American Journal of Operations Research"}},"results":[{"id":"W1964676846","doi":"10.4236/ajor.2011.14024","title":"Solving Bilevel Linear Multiobjective Programming Problems","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Linear programming; Decision maker; Pareto principle; Set (abstract data type); Pareto optimal; Computer science; Linear-fractional programming; Multiobjective programming; Mathematics; Resolution (logic); Multi-objective optimization; Optimization problem; Operations research; Artificial intelligence","authors":[{"name":"Calice Olivier Pieume","is_ca":true},{"name":"Patrice Marcotte","is_ca":true},{"name":"Laure Pauline Fotso","is_ca":false},{"name":"Patrick Siarry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109670152862659,"gpt":0.3538734093731688,"spread":0.2442032565105098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212204,0.001421507,0.001989344,0.0007083859,0.0005984301,0.002550283,0.001138986,0.001936296,0.002839528],"category_scores_gemma":[0.005114761,0.0006374569,0.001121767,0.00130459,0.0007875319,0.001511736,0.00213034,0.002087505,0.0005826098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004851343,"about_ca_system_score_gemma":0.001129228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303327,"about_ca_topic_score_gemma":0.000897788,"domain_scores_codex":[0.9987932,0.0006521377,0.00006372943,0.0001490284,0.0002062409,0.000135662],"domain_scores_gemma":[0.9982759,0.001289094,0.0001297015,0.00007208697,0.0001714789,0.0000617262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000432192,0.00006039835,0.0002935917,0.0004118371,0.00007744761,0.0001309745,0.0001239662,0.9229344,0.001225531,0.03099276,0.0006906274,0.0430152],"study_design_scores_gemma":[0.00001213026,0.0000374716,0.00004027837,0.00002867458,0.00001120014,0.00003364084,0.00004925981,0.9637544,0.0005197996,0.03415357,0.001351545,0.000007969974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009230673,0.0005556478,0.9865208,0.0001629192,0.00003261214,0.00003893284,0.00002786226,0.00005730288,0.00337331],"genre_scores_gemma":[0.4082527,0.002190225,0.5814542,0.000186216,0.0001780701,0.000477685,0.0002903724,0.0001550909,0.006815475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002839528,"threshold_uncertainty_score":0.0112226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965685568","doi":"10.4236/ajor.2013.32024","title":"A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Particle swarm optimization; Packing problems; Algorithm; Benchmark (surveying); Generator (circuit theory); Set (abstract data type); Circle packing; Sequence (biology); Mathematical optimization; Multi-swarm optimization; Phase (matter); Mathematics; Optimization problem; Computer science; Combinatorics; Power (physics)","authors":[{"name":"Mohamed A. Wahby Shalaby","is_ca":false},{"name":"Mohamed Kashkoush","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03452771659394198,"gpt":0.3214010978096618,"spread":0.2868733812157198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565088,0.001153191,0.00116845,0.0007045033,0.0005915133,0.0008719039,0.001106567,0.00167293,0.002498241],"category_scores_gemma":[0.001553597,0.0005083876,0.0007438635,0.000972828,0.0004156873,0.0006923242,0.000948024,0.001091638,0.0005887193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004933199,"about_ca_system_score_gemma":0.00125105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005862439,"about_ca_topic_score_gemma":0.003795786,"domain_scores_codex":[0.999675,0.0000917334,0.00002248512,0.00006458758,0.000110277,0.00003593092],"domain_scores_gemma":[0.9995384,0.0002547109,0.00004361473,0.00002846766,0.0001110995,0.00002377084],"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.00004415757,0.00004629598,0.0003280919,0.0000765229,0.0000278214,0.00005927189,0.00005121376,0.9419897,0.001225189,0.004335568,0.001819058,0.04999717],"study_design_scores_gemma":[0.00001164601,0.00002024868,0.00004087581,0.000004845018,0.000003898379,0.00000992997,0.000005955009,0.9982837,0.0001676236,0.0007205245,0.0007281663,0.000002610291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005988236,0.0001988848,0.9908862,0.000117284,0.00005984051,0.00009107253,0.00004733435,0.0002052128,0.002405879],"genre_scores_gemma":[0.1384824,0.0004149268,0.8550465,0.0001113657,0.00007343498,0.0006786319,0.0003194136,0.00007016837,0.004803155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005862439,"threshold_uncertainty_score":0.01165664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995445457","doi":"10.4236/ajor.2013.32026","title":"Generating Efficient Solutions in Bilevel Multi-Objective Programming Problems","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Decision maker; Mathematical optimization; Construct (python library); Point (geometry); Multiobjective programming; Linear programming; Computer science; Mathematics; Optimization problem; Multi-objective optimization; Operations research","authors":[{"name":"Calice Olivier Pieume","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Laure Pauline Fotso","is_ca":false},{"name":"Patrick Siarry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07852591409686466,"gpt":0.3622887004825126,"spread":0.2837627863856479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003339817,0.001150508,0.0016285,0.001039544,0.0006782916,0.001295218,0.001142494,0.001661318,0.002232539],"category_scores_gemma":[0.009036183,0.0008213276,0.0009584316,0.001178502,0.001285178,0.001560202,0.002479514,0.001850824,0.0004547206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006186052,"about_ca_system_score_gemma":0.0009577263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006005556,"about_ca_topic_score_gemma":0.0006395967,"domain_scores_codex":[0.9986799,0.0007213523,0.0000635347,0.0001501399,0.0002597701,0.0001252387],"domain_scores_gemma":[0.9969928,0.002238835,0.0002159575,0.0001526558,0.0003187107,0.0000809227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004760392,0.00005080021,0.0003772112,0.0001748825,0.00004023881,0.00009192398,0.0001298398,0.913575,0.00131124,0.05443016,0.0004674208,0.02930374],"study_design_scores_gemma":[0.00001908788,0.00004089603,0.00004491909,0.00002986843,0.000007487994,0.00002736284,0.00004277537,0.9547386,0.000957404,0.04325534,0.0008290553,0.000007233456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0180777,0.0001501083,0.9797413,0.0001214022,0.00001205035,0.00005438497,0.00002428556,0.00005721689,0.001761508],"genre_scores_gemma":[0.3014638,0.0003804961,0.6953473,0.0001064649,0.0000272115,0.0004839798,0.0001860739,0.0001364395,0.001868253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003339817,"threshold_uncertainty_score":0.01766282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998041568","doi":"10.4236/ajor.2012.24059","title":"Dominance-Based Rough Set Approach in Selection of Portfolio of Sustainable Development Projects","year":2012,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Cégep de l'Abitibi Témiscamingue; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Rough set; Computer science; Dominance (genetics); Portfolio; Dominance-based rough set approach; Set (abstract data type); Operations research; Futures contract; Sustainable development; Data mining; Process (computing); Management science; Business; Economics; Mathematics; Ecology; Finance","authors":[{"name":"Kazimierz Zaraś","is_ca":true},{"name":"Jean-Charles Marin","is_ca":true},{"name":"Bryan Boudreau-Trude","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06883002560422653,"gpt":0.3539966029945644,"spread":0.2851665773903378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007673485,0.0009460033,0.002203916,0.005139499,0.001021124,0.003496125,0.00138698,0.0008231382,0.001244334],"category_scores_gemma":[0.01162219,0.0004998441,0.002170616,0.003321163,0.0009757822,0.002439095,0.001113416,0.001109405,0.0001868198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002495362,"about_ca_system_score_gemma":0.002365562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003911162,"about_ca_topic_score_gemma":0.004071064,"domain_scores_codex":[0.9919248,0.004191566,0.0005758124,0.0005519018,0.00237786,0.0003780662],"domain_scores_gemma":[0.9946227,0.003819227,0.0004419866,0.0001798554,0.0007904019,0.0001458551],"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.0001605778,0.0001344022,0.003468714,0.0008528315,0.0005072936,0.0005780952,0.0006898732,0.6685267,0.002376848,0.1601381,0.002574418,0.1599921],"study_design_scores_gemma":[0.00004952697,0.000206938,0.001342028,0.0001722188,0.0001648431,0.0002338194,0.000268165,0.8467377,0.001325776,0.1450631,0.004358906,0.00007686904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02370259,0.001440244,0.9694909,0.0004425659,0.00005534495,0.00021542,0.000168684,0.00006842498,0.004415806],"genre_scores_gemma":[0.5172873,0.001737296,0.4783947,0.0001465108,0.0001030591,0.0004988387,0.0002932865,0.00002352268,0.001515561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007673485,"threshold_uncertainty_score":0.04058176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046036316","doi":"10.4236/ajor.2013.33035","title":"Computing the Distribution Function of the Number of Renewals","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Laplace transform; Laplace distribution; Mathematics; Laplace–Stieltjes transform; Variance (accounting); Distribution (mathematics); Applied mathematics; Two-sided Laplace transform; Laplace transform applied to differential equations; Function (biology); Renewal theory; Calculus (dental); Mathematical optimization; Mathematical analysis; Statistics; Fourier transform","authors":[{"name":"M. L. Chaudhry","is_ca":true},{"name":"Xiaofeng Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02900704029894172,"gpt":0.3727250329594432,"spread":0.3437179926605015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00204498,0.000521302,0.0009063943,0.002755913,0.0005529913,0.001239076,0.0009134716,0.000758489,0.002250309],"category_scores_gemma":[0.01505098,0.0003729787,0.0006128448,0.001303867,0.0009664996,0.001894709,0.0007594614,0.0009393127,0.0005769586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528377,"about_ca_system_score_gemma":0.001835329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005093121,"about_ca_topic_score_gemma":0.00270524,"domain_scores_codex":[0.999561,0.00008770612,0.00002349398,0.00009282768,0.0001658403,0.00006910042],"domain_scores_gemma":[0.9948265,0.003896757,0.0002381403,0.0002308082,0.0006835095,0.0001242171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002801202,0.0001163433,0.009081472,0.0001807488,0.0000769789,0.00034052,0.0003087175,0.7072908,0.01370016,0.1015198,0.001796792,0.1653075],"study_design_scores_gemma":[0.000008109037,0.00001023353,0.0005134455,0.000005128382,0.000004592674,0.00004776361,0.000016579,0.9843284,0.002042729,0.01275092,0.0002623071,0.000009743929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07211109,0.0001848948,0.9250975,0.0001708428,0.00002904775,0.00002538296,0.00007006281,0.0006872356,0.001624],"genre_scores_gemma":[0.6328688,0.0003037387,0.3629104,0.0000525962,0.0000664218,0.00008780965,0.0003582533,0.0002242295,0.003127846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005093121,"threshold_uncertainty_score":0.01108927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890394882","doi":"10.4236/ajor.2018.85020","title":"A Continuous Review Inventory System with Lost Sales and Emergency Orders","year":2018,"lang":"en","type":"review","venue":"American Journal of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Operations management; Lost sales; Operations research; Computer science; Business; Mathematics; Economics","authors":[{"name":"Michael Haughton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09218014604378812,"gpt":0.3742876701343237,"spread":0.2821075240905356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111461,0.0008488023,0.001148196,0.0009913226,0.0003697694,0.001933586,0.001550104,0.0009734617,0.001856013],"category_scores_gemma":[0.002245869,0.0004251249,0.0009947555,0.001697886,0.0004921267,0.001898123,0.000592636,0.0006264804,0.0004062075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528687,"about_ca_system_score_gemma":0.002044951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00657979,"about_ca_topic_score_gemma":0.00482278,"domain_scores_codex":[0.9991397,0.0002227215,0.00005127096,0.0001195068,0.0003681491,0.00009873795],"domain_scores_gemma":[0.9988841,0.0004851748,0.0002646013,0.00005060118,0.000270201,0.00004526752],"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.0006376739,0.0006113536,0.01165505,0.01114945,0.0008217025,0.002936561,0.0004256392,0.4231443,0.005611046,0.07203171,0.01287931,0.4580961],"study_design_scores_gemma":[0.0002144599,0.00127855,0.01374315,0.001900403,0.001046795,0.002835451,0.00062435,0.8556432,0.00361693,0.03360411,0.08523044,0.0002622065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.2632976,0.4270019,0.242295,0.00273217,0.0009357907,0.0006423908,0.0007641613,0.0004289407,0.06190209],"genre_scores_gemma":[0.8436269,0.1179771,0.02834945,0.0002720872,0.0005987246,0.0001388562,0.0004650945,0.0000357215,0.008536004],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00657979,"threshold_uncertainty_score":0.01308298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971729061","doi":"10.4236/ajor.2014.44026","title":"Using DEA and AHP for Ratio Analysis","year":2014,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Data envelopment analysis; Analytic hierarchy process; Ranking (information retrieval); Set (abstract data type); Measure (data warehouse); Computer science; Parametric statistics; Range (aeronautics); Closeness; Efficiency; Mathematics; Operations research; Mathematical optimization; Statistics; Data mining; Engineering; Artificial intelligence","authors":[{"name":"Mohammad Sadegh Pakkar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3226641979201922,"gpt":0.5640352884855022,"spread":0.24137109056531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01353848,0.002313458,0.002103308,0.007426123,0.0009321571,0.003446215,0.001808519,0.0008365529,0.002137607],"category_scores_gemma":[0.0209223,0.0008054191,0.002377111,0.006732463,0.001259532,0.002362774,0.002464761,0.002413217,0.0003256664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002488668,"about_ca_system_score_gemma":0.002652599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00461778,"about_ca_topic_score_gemma":0.004047903,"domain_scores_codex":[0.9850298,0.008804199,0.0008843017,0.000946023,0.004027227,0.0003084449],"domain_scores_gemma":[0.9911027,0.00657669,0.0007449527,0.0003956361,0.001085473,0.00009461856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000983154,0.0001347255,0.001595552,0.001019042,0.0006397984,0.0001546999,0.0003894406,0.6253428,0.00190991,0.1663971,0.001073039,0.2012456],"study_design_scores_gemma":[0.00003574071,0.00009755413,0.0004763735,0.0001632156,0.0001039038,0.00005377406,0.0001794656,0.8747642,0.00163635,0.1164843,0.005943399,0.00006168484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002417653,0.00032385,0.995196,0.00007926422,0.00002430928,0.0001393571,0.00005770209,0.00007619982,0.001685672],"genre_scores_gemma":[0.1159758,0.0009671244,0.8813949,0.00005767805,0.00005139149,0.0006717532,0.0002242587,0.0000574143,0.0005997732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01353848,"threshold_uncertainty_score":0.07159919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037616197","doi":"10.4236/ajor.2011.13015","title":"A Hierarchical Methodology for Performance Evaluation Based on Data Envelopment Analysis: The Case of Companies’ Competitiveness in an Economy","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Data envelopment analysis; Index (typography); Identification (biology); Computer science; Industrial organization; Operations research; Business; Econometrics; Economics; Mathematics; Statistics","authors":[{"name":"Mohamed Dia","is_ca":true},{"name":"Fouad Ben Abdelaziz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6756018683741475,"gpt":0.5818432606939765,"spread":0.09375860768017097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009074522,0.001130059,0.001322501,0.004190898,0.001094329,0.003079462,0.001182045,0.001136667,0.001771868],"category_scores_gemma":[0.01310702,0.0004687398,0.001918543,0.006100126,0.00215617,0.002191071,0.001943273,0.001975464,0.0003851655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003115256,"about_ca_system_score_gemma":0.003188302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007915975,"about_ca_topic_score_gemma":0.004964459,"domain_scores_codex":[0.9885633,0.006967859,0.0004818952,0.0007008823,0.002909351,0.0003766889],"domain_scores_gemma":[0.9945649,0.003391244,0.0005438552,0.0007086726,0.0006831622,0.0001082044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003343613,0.00007060616,0.001447653,0.000432542,0.0001882828,0.0001848264,0.0005042001,0.3198049,0.002302545,0.5721638,0.001418272,0.101449],"study_design_scores_gemma":[0.00002395381,0.0001299037,0.001890938,0.0002003486,0.00008540378,0.0001071847,0.000277512,0.6687445,0.001982594,0.3135109,0.01295371,0.00009302659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003074147,0.0003790246,0.9936395,0.0001520736,0.00001673459,0.00008692999,0.0000664326,0.00004140738,0.002543709],"genre_scores_gemma":[0.1581593,0.0007915015,0.8396651,0.0000750227,0.00005190885,0.0003949528,0.0001496785,0.00004029613,0.0006724161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009074522,"threshold_uncertainty_score":0.04799122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1582557684","doi":"10.4236/ajor.2015.55026","title":"Using DEA and AHP for Multiplicative Aggregation of Hierarchical Indicators","year":2015,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Analytic hierarchy process; Data envelopment analysis; Multiplicative function; Hierarchy; Computer science; Set (abstract data type); Operations research; Construct (python library); Data mining; Mathematics; Statistics; Economics","authors":[{"name":"Mohammad Sadegh Pakkar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3821685235789269,"gpt":0.557091714635482,"spread":0.1749231910565551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01573157,0.002079337,0.001730024,0.004994051,0.001252532,0.003242721,0.001520717,0.0007378134,0.001882792],"category_scores_gemma":[0.02247562,0.0008835554,0.002567138,0.007944075,0.001118921,0.002508459,0.00290477,0.003061553,0.0003305987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329186,"about_ca_system_score_gemma":0.003239997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00556885,"about_ca_topic_score_gemma":0.007825757,"domain_scores_codex":[0.986439,0.007986064,0.001285602,0.0009506264,0.003037436,0.0003013009],"domain_scores_gemma":[0.9912663,0.005779587,0.0007673968,0.0005586153,0.001535036,0.00009310502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009494265,0.0001684252,0.002160683,0.001613787,0.001046005,0.0002596316,0.001465495,0.4109715,0.004072994,0.2108688,0.00244363,0.3648342],"study_design_scores_gemma":[0.0000345401,0.0001170912,0.0008407441,0.0002333053,0.0001910204,0.00006433413,0.0003361017,0.8572223,0.002444822,0.128458,0.009965886,0.00009197817],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001752994,0.0002069848,0.9965233,0.00008142736,0.00003585988,0.0001673414,0.00005485534,0.00006413122,0.001113214],"genre_scores_gemma":[0.06013839,0.0004548379,0.9381101,0.00004371912,0.00002839458,0.0006460836,0.0001816057,0.00003379973,0.0003630419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01573157,"threshold_uncertainty_score":0.08319753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2617507377","doi":"10.4236/ajor.2017.73014","title":"System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction","year":2017,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Polygon (computer graphics); Computation; Reliability (semiconductor); Algorithm; Reduction (mathematics); Computer science; Series (stratigraphy); Mathematical optimization; Node (physics); Process (computing); Mathematics; Theoretical computer science","authors":[{"name":"Mohamed-Larbi Rebaiaia","is_ca":true},{"name":"Daoud Aı̈t-Kadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08582483862008403,"gpt":0.4240188789983182,"spread":0.3381940403782342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008487263,0.0005478627,0.0006175781,0.0008551385,0.0002609183,0.0004752777,0.0005705,0.0002735996,0.001145936],"category_scores_gemma":[0.003718517,0.000218992,0.0005937441,0.0006030213,0.000792094,0.0007932157,0.0004277163,0.000450199,0.0001276098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008216673,"about_ca_system_score_gemma":0.0006853395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003897684,"about_ca_topic_score_gemma":0.002840714,"domain_scores_codex":[0.9996192,0.0001471648,0.00001349907,0.00003572514,0.0001493747,0.00003493729],"domain_scores_gemma":[0.998836,0.0008237787,0.0001095684,0.000099442,0.0001125225,0.00001878243],"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.00001119674,0.000003274021,0.0001819583,0.00001364395,0.000005474207,0.00002085411,0.00001134949,0.9875349,0.0005349996,0.007116624,0.00004966456,0.004516058],"study_design_scores_gemma":[7.962429e-7,0.000009747703,0.00004353989,0.000001168038,0.000002167463,0.000006686796,0.000003356745,0.997126,0.0003075456,0.002418341,0.00007933179,0.000001361601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04006644,0.00007156937,0.9573153,0.00003593233,0.000007529385,0.0000265855,0.00002972708,0.0001132102,0.002333828],"genre_scores_gemma":[0.8493165,0.0002441539,0.1490224,0.00001194014,0.00001548323,0.00006650257,0.00008568761,0.00006019591,0.001177132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003897684,"threshold_uncertainty_score":0.007750034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093411841","doi":"10.4236/ajor.2015.52006","title":"Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Cutting-plane method; Scheduling (production processes); Plane (geometry); Computer science; Inequality; Due date; Preemption; Mathematical optimization; Mathematics; Algorithm; Operations research; Geometry; Integer programming; Programming language; Mathematical analysis; Queue; Operating system","authors":[{"name":"Fei Yang","is_ca":true},{"name":"Shengyuan Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07349344966246948,"gpt":0.3500015452314819,"spread":0.2765080955690125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002036263,0.001340888,0.001268903,0.0008588364,0.0003729305,0.001285773,0.001386251,0.001085862,0.002453361],"category_scores_gemma":[0.00390484,0.0006621866,0.001054065,0.001320689,0.0008167428,0.001553968,0.001536481,0.002662156,0.0002185734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001164646,"about_ca_system_score_gemma":0.00133964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055636,"about_ca_topic_score_gemma":0.001558605,"domain_scores_codex":[0.998867,0.0003672487,0.00004618566,0.0001405507,0.0004259168,0.0001530656],"domain_scores_gemma":[0.9972054,0.001938908,0.0003399902,0.0001198559,0.0002722472,0.0001236032],"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.00004230499,0.00003350505,0.0001951023,0.00009357083,0.00002641147,0.00005534274,0.00002482562,0.9477555,0.001498161,0.03469563,0.0006381795,0.01494143],"study_design_scores_gemma":[0.000004745986,0.00002353904,0.00005826474,0.000005321358,0.000004525672,0.000008686941,0.000003722787,0.9834189,0.0002234174,0.01599454,0.0002511983,0.00000315982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01150773,0.0003521031,0.986019,0.0001723727,0.00003145056,0.00002694122,0.00008187989,0.00005884312,0.001749593],"genre_scores_gemma":[0.7413507,0.001637865,0.2512107,0.0003079287,0.0001629072,0.000327898,0.0005683923,0.0001291392,0.004304563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002453361,"threshold_uncertainty_score":0.01076889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100018616","doi":"10.4236/ajor.2011.14031","title":"Optimal Generator Portfolio in Day-Ahead Market under Uncertain Carbon Tax Policy","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Portfolio; Carbon tax; Bidding; Robustness (evolution); Flexibility (engineering); Electricity market; Economics; Generator (circuit theory); Computer science; Electricity; Microeconomics; Finance; Power (physics); Greenhouse gas; Engineering","authors":[{"name":"Shengyuan Chen","is_ca":true},{"name":"Ming Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0409485687936573,"gpt":0.3257403080883186,"spread":0.2847917392946612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100533,0.0005575085,0.001064228,0.0003322357,0.0003438676,0.001570275,0.0006863971,0.001357952,0.002640676],"category_scores_gemma":[0.002256194,0.0005199788,0.0003561129,0.0003905549,0.000693417,0.001512647,0.0005428246,0.000802519,0.0002254692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121493,"about_ca_system_score_gemma":0.0009615633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003916695,"about_ca_topic_score_gemma":0.002964818,"domain_scores_codex":[0.9996743,0.0001528779,0.00001015054,0.00005054582,0.00004462091,0.0000675167],"domain_scores_gemma":[0.9993427,0.0003635235,0.0001115193,0.0000273911,0.00006648028,0.00008831101],"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.00004158047,0.00001410504,0.0002660271,0.00001069028,0.00000840267,0.00006743321,0.00001059464,0.9874426,0.0004004181,0.01030585,0.0002479231,0.001184485],"study_design_scores_gemma":[0.00000615675,0.000008096794,0.00007991309,0.00000123743,0.000002312294,0.000005652009,0.000005638512,0.996846,0.00005752648,0.002933747,0.00005079121,0.000002750587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6358452,0.000453375,0.3453595,0.001154654,0.00004534093,0.00008464567,0.0004391639,0.0001693037,0.01644883],"genre_scores_gemma":[0.9889405,0.0001286507,0.007059231,0.00003101712,0.000008514031,0.0000279485,0.00007611129,0.00002191428,0.003706101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003916695,"threshold_uncertainty_score":0.008833885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048027870","doi":"10.4236/ajor.2012.23039","title":"A DSS for Human Resettlement: Supporting Interactive Optimal Decisions","year":2012,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Relocation; Decision support system; Computer science; Decision aids; Operations research; Management science; Process management; Knowledge management; Human resources; Risk analysis (engineering); Business; Artificial intelligence; Engineering; Economics; Management","authors":[{"name":"Sajjad Zahir","is_ca":true},{"name":"Ziaul Al-Mahmud","is_ca":true},{"name":"Ruhul Sarker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1427099034347518,"gpt":0.4512886728739023,"spread":0.3085787694391505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255156,0.0009233469,0.0007755861,0.0007654447,0.0006886806,0.00194689,0.001265295,0.001366987,0.009746251],"category_scores_gemma":[0.003308143,0.0003700963,0.0004406985,0.0005829831,0.0002939045,0.001170608,0.001070555,0.0008331033,0.00119712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005378077,"about_ca_system_score_gemma":0.001145762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00376658,"about_ca_topic_score_gemma":0.005325085,"domain_scores_codex":[0.9995498,0.0001722837,0.00006353645,0.00007859117,0.0001088043,0.00002701713],"domain_scores_gemma":[0.9982504,0.001100203,0.0001281686,0.0001346805,0.0002418798,0.0001445467],"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.001452988,0.001137572,0.007089375,0.001355086,0.0002998854,0.001488265,0.001798971,0.4382622,0.03050472,0.01985539,0.05081619,0.4459394],"study_design_scores_gemma":[0.0002233972,0.0001696492,0.000995767,0.000101381,0.0001081763,0.0001199377,0.0002681892,0.9499629,0.008010049,0.006568525,0.03339802,0.00007403391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1037094,0.0006578822,0.8381411,0.002126546,0.0004144829,0.001037708,0.004523075,0.03617296,0.01321687],"genre_scores_gemma":[0.4755282,0.0006870517,0.5142084,0.0003511335,0.0000859701,0.0006612989,0.002923697,0.0003216511,0.005232597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009746251,"threshold_uncertainty_score":0.03260446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890533656","doi":"10.4236/ajor.2018.85019","title":"Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem","year":2018,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Swine Innovation Porc","keywords":"Set (abstract data type); Mathematical optimization; Pareto principle; Solver; Linear programming; Computation; Simple (philosophy); Computer science; Decision maker; Pareto interpolation; Space (punctuation); Mathematics; Algorithm; Operations research; Statistics; Programming language","authors":[{"name":"François Dubeau","is_ca":true},{"name":"Marie Emmanuel Ntigura Habingabwa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04879858949140138,"gpt":0.3885260895847644,"spread":0.339727500093363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823136,0.001507035,0.001379558,0.001619272,0.0009219917,0.001465373,0.001039074,0.00117391,0.005012034],"category_scores_gemma":[0.004439996,0.0006657782,0.001295335,0.001035293,0.0007054147,0.0009867859,0.001734645,0.002162188,0.000927176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023235,"about_ca_system_score_gemma":0.002104301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00512906,"about_ca_topic_score_gemma":0.004888615,"domain_scores_codex":[0.9993429,0.0002299798,0.00003265421,0.00007106216,0.0002169117,0.0001064897],"domain_scores_gemma":[0.998209,0.001177517,0.00009472733,0.00008128284,0.0003652285,0.00007222858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001217444,0.000140854,0.0008095558,0.0001420291,0.00005023931,0.0001390988,0.0001427212,0.8711078,0.003656836,0.03290685,0.001733716,0.08904856],"study_design_scores_gemma":[0.00001544523,0.00002586315,0.00007843546,0.000009241652,0.00000407871,0.00001304436,0.00001919689,0.9885867,0.0007640268,0.009989189,0.0004887191,0.000006092465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01830841,0.00007315307,0.9785529,0.00008207597,0.00001818723,0.00005369651,0.00006078603,0.0005205582,0.002330275],"genre_scores_gemma":[0.1736415,0.0001020111,0.8233493,0.00006711077,0.00001841613,0.0003620529,0.0003091176,0.0003248422,0.001825742],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00512906,"threshold_uncertainty_score":0.01676691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405036614","doi":"10.4236/ajor.2024.146009","title":"An Elementary Approach to the Vehicle Routing Problem via Python and Google API","year":2024,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University; Queen's University Belfast","keywords":"Python (programming language); Computer science; Vehicle routing problem; Programming language; World Wide Web; Information retrieval; Routing (electronic design automation); Computer network","authors":[{"name":"Kai Q. Lian","is_ca":false},{"name":"Gareth A. Tribello","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03696489952496746,"gpt":0.370099402085067,"spread":0.3331345025600996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288174,0.001169906,0.0005282605,0.0005795907,0.0006303327,0.001430686,0.00282092,0.001008228,0.03243108],"category_scores_gemma":[0.002705506,0.0006197716,0.001753011,0.0007198615,0.0005545079,0.001711534,0.001986854,0.002259815,0.01035949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007748319,"about_ca_system_score_gemma":0.002874351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007863419,"about_ca_topic_score_gemma":0.01311809,"domain_scores_codex":[0.9994018,0.000123758,0.00004920825,0.0001042893,0.0002218568,0.00009907092],"domain_scores_gemma":[0.9994218,0.0002614528,0.00004702456,0.00009868421,0.0001313423,0.0000396488],"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.0002371768,0.0003111203,0.002820299,0.001514652,0.000137202,0.0007185685,0.0004699311,0.4007361,0.006838954,0.2142923,0.1767121,0.1952115],"study_design_scores_gemma":[0.0000820213,0.00004131293,0.0005157952,0.00009287905,0.00002073944,0.0002372247,0.000077998,0.7688556,0.00310964,0.08215088,0.1447629,0.00005296693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003466363,0.0001166735,0.9348076,0.0007342697,0.0001252775,0.0003184718,0.00431329,0.0341299,0.02198811],"genre_scores_gemma":[0.07619423,0.000459785,0.8895805,0.000656099,0.00006554401,0.001650213,0.00693495,0.006995333,0.01746333],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03243108,"threshold_uncertainty_score":0.1084929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}