Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …
(2004), knapsack problems became a classical and rich research area in combinatorial …
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
The IEEE 802.11 Wireless LAN standards allow multiple non-overlapping frequency
channels to be used simultaneously to increase the aggregate bandwidth available to end …
channels to be used simultaneously to increase the aggregate bandwidth available to end …
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets
have inherently overlapping clusters. Several approaches to finding overlapping clusters …
have inherently overlapping clusters. Several approaches to finding overlapping clusters …
Parallel computation with molecular-motor-propelled agents in nanofabricated networks
The combinatorial nature of many important mathematical problems, including
nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the …
nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the …
Approximation algorithms for the multiple knapsack problem with assignment restrictions
Motivated by a real world application, we study the multiple knapsack problem with
assignment restrictions (MKAR). We are given a set of items, each with a positive real …
assignment restrictions (MKAR). We are given a set of items, each with a positive real …
Mathematical models and decomposition methods for the multiple knapsack problem
We consider the multiple knapsack problem, that calls for the optimal assignment of a set of
items, each having a profit and a weight, to a set of knapsacks, each having a maximum …
items, each having a profit and a weight, to a set of knapsacks, each having a maximum …
Integrated approach for the assessment of strategies for the decarbonization of urban traffic
This paper presents a new methodology to derive and analyze strategies for a fully
decarbonized urban transport system which combines conceptual vehicle design, a large …
decarbonized urban transport system which combines conceptual vehicle design, a large …
A channel assignment algorithm for multi-radio wireless mesh networks
S Avallone, IF Akyildiz - Computer Communications, 2008 - Elsevier
Wireless mesh networks (WMNs) are receiving increasing attention as an effective means to
deploy ISP's wireless last mile access, wireless enterprise backbone networks and several …
deploy ISP's wireless last mile access, wireless enterprise backbone networks and several …
Toward improved path programmability recovery for software-defined WANs under multiple controller failures
Enabling path programmability is an essential feature of Software-Defined Networking
(SDN). During controller failures in Software-Defined Wide Area Networks (SD-WANs), a …
(SDN). During controller failures in Software-Defined Wide Area Networks (SD-WANs), a …
Channel partitioning for wireless local area networks
K Medepalli, D Famolari, P Gopalakrishnan… - US Patent …, 2010 - Google Patents
(*) Notice: Subject to any s the t Cruz-Perez et al., Electronics Letters 24th, Jun. 1996, vol.
35, No. 13, patent is extended or adjusted under 35 title—Handoffprioritization with implicit …
35, No. 13, patent is extended or adjusted under 35 title—Handoffprioritization with implicit …