{"id":"W2608166121","doi":"","title":"An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays","year":2014,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Bandwidth (computing); Integer programming; Computer science; Mathematical optimization; Linear programming; Queueing theory; Bandwidth allocation; Cutting-plane method; Telecommunications network; Revenue; Piecewise linear function; Computer network; Mathematics","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.001063418,0.00171311,0.001643913,0.001213392,0.0006643865,0.001986076,0.001873697,0.001637716,0.005846326],"category_scores_gemma":[0.002410092,0.001018522,0.001415693,0.002180222,0.0007426388,0.001567636,0.001301096,0.002255362,0.0006606596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781301,"about_ca_system_score_gemma":0.00192831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004034181,"about_ca_topic_score_gemma":0.003144901,"domain_scores_codex":[0.9992067,0.0002908114,0.00002788538,0.0001332658,0.0002022542,0.0001390577],"domain_scores_gemma":[0.9993365,0.0004507589,0.00005799722,0.00004012671,0.00007536339,0.00003915884],"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.00004228874,0.0000939533,0.0001446964,0.0001471233,0.00002832263,0.00007770986,0.00005650953,0.9106407,0.001225093,0.05523685,0.002312115,0.02999467],"study_design_scores_gemma":[0.000009960296,0.00002235862,0.00002500338,0.000009301457,0.000007292628,0.00002173096,0.00001865665,0.984015,0.0002144237,0.01448921,0.00116315,0.000003874427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004254231,0.0002457146,0.9912037,0.0001784927,0.00004753737,0.00007237291,0.00005362242,0.00009530965,0.003849101],"genre_scores_gemma":[0.1787956,0.00100688,0.8118355,0.0002245949,0.0001476002,0.000558652,0.0002985549,0.0001963038,0.006936292],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005846326,"threshold_uncertainty_score":0.01955789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02105969668305532,"score_gpt":0.2692252511540504,"score_spread":0.2481655544709951,"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."}}