{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001787883,0.0003618514,0.000495005,0.0003504345,0.0002104414,0.0003097238,0.0004684351,0.0004867656,0.000009167189],"category_scores_gemma":[0.00006070287,0.0003774595,0.0001010824,0.0001327425,0.0001192395,0.00009031484,0.0001769587,0.001176622,0.000001629331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008035376,"about_ca_system_score_gemma":0.0002070476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002529168,"about_ca_topic_score_gemma":0.00004136098,"domain_scores_codex":[0.9974825,0.0001684059,0.0005340623,0.0007510019,0.0002447084,0.000819297],"domain_scores_gemma":[0.9986081,0.0001954983,0.0001231874,0.0007068525,0.0001710379,0.0001953731],"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.00007695484,0.0001005995,0.0003517654,0.0006552895,0.0000595909,9.267494e-7,0.0004597049,0.9820457,0.00006359907,0.001094082,0.00002546085,0.0150664],"study_design_scores_gemma":[0.001104518,0.0001500864,0.00006477151,0.000240433,0.00001184671,0.000003931859,0.0001102727,0.9956535,0.0001141187,0.0004611518,0.001626804,0.0004585873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.275099,0.0004389042,0.4704249,0.0001859069,0.004819222,0.01367316,0.0002690909,0.00199849,0.2330913],"genre_scores_gemma":[0.9559202,0.0004181642,0.04199903,0.0000113171,0.0003572641,0.0006649927,0.0004005587,0.0001679879,0.00006044142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6808212,"threshold_uncertainty_score":0.9998677,"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."}}