{"id":"W4321850636","doi":"10.2139/ssrn.4370160","title":"Solving the Park-and-Loop Routing Problem by Branch-Price-And-Cut","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Loop (graph theory); Branch and cut; Routing (electronic design automation); Branch and price; Computer science; Mathematical optimization; Economics; Mathematics; Integer programming; Computer network; Combinatorics","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.0008362692,0.0001686761,0.0001629164,0.00006196398,0.0003073292,0.00008191772,0.0002343316,0.00009402475,0.000003533351],"category_scores_gemma":[0.00009914442,0.0001233968,0.00004080209,0.0003456064,0.00008550136,0.0001706926,0.0001077403,0.002001442,0.00001746837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000223628,"about_ca_system_score_gemma":0.0000635326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003277304,"about_ca_topic_score_gemma":0.00004243742,"domain_scores_codex":[0.9974726,0.0000217749,0.0002272861,0.00015633,0.0001491678,0.001972826],"domain_scores_gemma":[0.9995673,0.0001761966,0.0000470585,0.0001370861,0.0000191142,0.00005326029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001995143,0.00001645894,0.002094052,0.00005914504,0.0004592354,0.00001261023,0.0005723749,0.02662534,0.009915125,0.2404061,0.002924153,0.7168955],"study_design_scores_gemma":[0.0007729164,0.0001821951,0.0004784724,0.0001462054,0.00006576933,0.0006743143,0.00293638,0.09721905,0.0006969089,0.8904935,0.005685449,0.0006489062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8281797,0.03859534,0.1229731,0.004412537,0.0003058396,0.0004009177,0.000003125182,0.002624435,0.002504969],"genre_scores_gemma":[0.9681791,0.03032435,0.0008676149,0.00003498848,0.0001186618,0.00001242713,0.000001306284,0.00004805623,0.0004134699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7162466,"threshold_uncertainty_score":0.8695381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005344881901239749,"score_gpt":0.2070016708498799,"score_spread":0.2016567889486401,"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."}}