{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443573,0.001354945,0.002246837,0.001256881,0.001003867,0.001999599,0.001661679,0.002554042,0.01592053],"category_scores_gemma":[0.004676506,0.00102262,0.001000641,0.001879371,0.0009380234,0.002260484,0.001138761,0.002173092,0.001218735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342978,"about_ca_system_score_gemma":0.002838919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008613495,"about_ca_topic_score_gemma":0.01019712,"domain_scores_codex":[0.999366,0.0002306392,0.00002199043,0.000118226,0.0001204089,0.0001426352],"domain_scores_gemma":[0.9977228,0.001812055,0.0001062295,0.00009473547,0.0001661166,0.00009796685],"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.000162115,0.000212157,0.0005296003,0.0002442392,0.00005205036,0.0001252867,0.0000634242,0.8991404,0.0009740205,0.02360125,0.007749688,0.06714583],"study_design_scores_gemma":[0.00006495681,0.00005507479,0.00008693541,0.000009379715,0.00001250248,0.00002357982,0.00003016442,0.974911,0.0002914076,0.02360189,0.0009064344,0.000006656443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05764397,0.0007119966,0.9163204,0.001561532,0.0002310495,0.0003481678,0.0005319293,0.0006278868,0.02202299],"genre_scores_gemma":[0.4151278,0.000648379,0.563028,0.0003048604,0.0002040061,0.0003997295,0.0008731681,0.0003797975,0.01903434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01592053,"threshold_uncertainty_score":0.05325955,"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."}}