We prove that the extension complexity of independence polytope every regular matroid on [Formula: see text] elements is text]. Past results Wong and Martin extended formulations spanning tree a graph imply bound for special case (co)graphic matroids. However, general was open, despite recent attempts. also consider circuit dominants matroids, which we give bound.

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...