{"id":"W2093224514","doi":"10.1007/s10878-005-1778-8","title":"Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Travelling salesman problem; Theory of computation; Scheduling (production processes); Mathematics; Computer science; Implementation; Combinatorics; Mathematical optimization; Algorithm","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.0007336813,0.0001808473,0.0003329995,0.0002328969,0.0002245049,0.0002337584,0.0009668889,0.000125058,0.00004701852],"category_scores_gemma":[0.0001813985,0.0001366384,0.0001837635,0.0006950668,0.00005333998,0.0009233813,0.0001205145,0.0003417711,0.000005171157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001383517,"about_ca_system_score_gemma":0.0004332616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006458255,"about_ca_topic_score_gemma":0.00000137594,"domain_scores_codex":[0.9976575,0.0002171418,0.0008829451,0.0001970572,0.0007858594,0.0002595386],"domain_scores_gemma":[0.9975929,0.0001713487,0.001047772,0.0002993055,0.0007600244,0.0001286512],"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.00007863035,0.0003687736,0.00009881397,0.00001987705,0.00002067669,0.000004856618,0.0004600076,0.9820893,0.0003079456,0.01544549,0.0004767989,0.0006288498],"study_design_scores_gemma":[0.003197146,0.0007342258,0.00009655448,0.0001630899,0.00004458845,0.00004726745,0.00005891694,0.9874484,0.005772328,0.001320182,0.0008802508,0.0002370547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02323306,0.0002802159,0.9571854,0.003695976,0.007266866,0.0008391993,0.000003807957,0.0000730938,0.007422341],"genre_scores_gemma":[0.6542891,0.0001993364,0.3432285,0.0001133203,0.001965343,0.000002634004,0.000002364217,0.0000243866,0.0001750086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.631056,"threshold_uncertainty_score":0.5571952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0154251013706192,"score_gpt":0.2412177868623189,"score_spread":0.2257926854916997,"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."}}