{"id":"W2150336620","doi":"10.1287/ijoc.1040.0127","title":"Integer Linear Programming Models for Global Routing","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Branch and price; Branch and cut; Linear programming; Mathematical optimization; Integer (computer science); Mathematics; Linear programming relaxation; Routing (electronic design automation); Branch and bound; Computer science; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.001530434,0.002576322,0.001291265,0.0008242099,0.0005285882,0.002676844,0.001953337,0.002265332,0.01444721],"category_scores_gemma":[0.003718602,0.0007569091,0.001202557,0.002392655,0.001017245,0.002113796,0.00132487,0.004369124,0.004208716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002012478,"about_ca_system_score_gemma":0.002071334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006046705,"about_ca_topic_score_gemma":0.005660781,"domain_scores_codex":[0.9986932,0.0006293148,0.00005524608,0.0001964611,0.0002868091,0.0001390058],"domain_scores_gemma":[0.9984745,0.001106096,0.0001306082,0.00006744685,0.0001836298,0.00003766135],"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.00003830474,0.00007209741,0.0001684112,0.0002908353,0.00004424045,0.0001012141,0.0001018308,0.5850477,0.0003013237,0.3567559,0.01746847,0.03960963],"study_design_scores_gemma":[0.00002581572,0.00002487531,0.00005602575,0.00006925954,0.00001364368,0.00003268645,0.00003937636,0.7581052,0.0001150886,0.2121286,0.02937592,0.00001339133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001275184,0.00524596,0.953803,0.001520261,0.0002676989,0.0001019838,0.0006827679,0.0004282907,0.0366748],"genre_scores_gemma":[0.2704982,0.02053405,0.6347473,0.001778847,0.001463011,0.002179396,0.00374526,0.0008298144,0.06422416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01444721,"threshold_uncertainty_score":0.04833072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01661284083326245,"score_gpt":0.2549549355216916,"score_spread":0.2383420946884292,"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."}}