{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082493,0.0008608186,0.001463384,0.0006690657,0.001378745,0.003043451,0.001598341,0.002451781,0.008744835],"category_scores_gemma":[0.006801879,0.0006529942,0.001120967,0.001157459,0.001281583,0.003188474,0.001122193,0.001436188,0.000699082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008427592,"about_ca_system_score_gemma":0.001210729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002323725,"about_ca_topic_score_gemma":0.003484962,"domain_scores_codex":[0.9989504,0.0002850462,0.00005961137,0.0002177127,0.0001174651,0.0003697426],"domain_scores_gemma":[0.9950067,0.003055759,0.0007378647,0.0005471195,0.0002748412,0.0003776516],"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.001702208,0.0007046948,0.003357525,0.0006132847,0.0001826735,0.003008728,0.0006366363,0.3833822,0.008396162,0.5475208,0.01819027,0.03230482],"study_design_scores_gemma":[0.0002099289,0.0001150718,0.0005749353,0.0000162258,0.00003723634,0.0006793771,0.0003397817,0.6446012,0.002335515,0.3487517,0.002297696,0.00004142052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7328811,0.0004027168,0.2201125,0.001288068,0.0001826686,0.000224793,0.0009463147,0.0003490915,0.04361269],"genre_scores_gemma":[0.9532993,0.000195081,0.03842638,0.0001025367,0.00009396965,0.00007746676,0.000588197,0.00009247317,0.00712453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008744835,"threshold_uncertainty_score":0.02925438,"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."}}