{"id":"W2061091622","doi":"10.1016/j.ejor.2009.07.007","title":"Heuristics for the Stochastic Eulerian Tour Problem","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Eulerian path; Concatenation (mathematics); Mathematical optimization; Heuristic; Computer science; Grid; Probabilistic logic; Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Combinatorics; Artificial intelligence; Applied mathematics; Lagrangian","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.001322858,0.001035588,0.001149115,0.001247137,0.0006763976,0.001208766,0.001606985,0.001299345,0.00538809],"category_scores_gemma":[0.004164045,0.0008707345,0.0008809247,0.001805921,0.001010435,0.001534771,0.001247953,0.001569052,0.0005481304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002063306,"about_ca_system_score_gemma":0.002998373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01242012,"about_ca_topic_score_gemma":0.01857397,"domain_scores_codex":[0.9992414,0.0003293921,0.00003081528,0.0001056009,0.0001369957,0.0001558405],"domain_scores_gemma":[0.9978547,0.001558517,0.0001612751,0.0001300615,0.0001496806,0.0001457769],"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.0001117302,0.00007485306,0.0002714327,0.0000974547,0.00003643103,0.00004478752,0.000054617,0.9290968,0.0004323316,0.03375755,0.004138593,0.0318834],"study_design_scores_gemma":[0.0000545733,0.00003151359,0.0001025506,0.00001495929,0.0000124291,0.00001636174,0.00002236145,0.9775749,0.0001515256,0.02031929,0.001691019,0.000008488713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05115039,0.001286142,0.9328056,0.0006897608,0.0002056018,0.0002391539,0.0003792254,0.000721075,0.01252315],"genre_scores_gemma":[0.4067813,0.001136149,0.5812555,0.0003063864,0.0001534051,0.0003282388,0.0007762502,0.000355118,0.008907667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01242012,"threshold_uncertainty_score":0.02469563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08847412350347472,"score_gpt":0.3704656567390892,"score_spread":0.2819915332356145,"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."}}