Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems

V Cacchiani, M Iori, A Locatelli, S Martello - Computers & Operations …, 2022 - Elsevier
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 …

Infinite cacheflow in software-defined networks

N Katta, O Alipourfard, J Rexford, D Walker - Proceedings of the third …, 2014 - dl.acm.org
Software-Defined Networking (SDN) enables fine-grained policies for firewalls, load
balancers, routers, traffic monitoring, and other functionality. While Ternary Content …

Wildcard rules caching and cache replacement algorithms in software-defined networking

JP Sheu, YC Chuo - IEEE Transactions on Network and …, 2016 - ieeexplore.ieee.org
In software-defined networking, flow tables of OpenFlow switches are implemented by
ternary content addressable memory (TCAM). Although TCAM can process input packets in …

A graph theoretic approach for multi-objective budget constrained capsule wardrobe recommendation

S Patil, D Banerjee, S Sural - ACM Transactions on Information Systems …, 2021 - dl.acm.org
Traditionally, capsule wardrobes are manually designed by expert fashionistas through their
creativity and technical prowess. The goal is to curate minimal fashion items that can be …

[PDF][PDF] Rule-based system architecting of Earth observation satellite systems

DS Valero - 2012 - researchgate.net
Abstract System architecting is concerned with exploring the tradespace of early, high-level,
system design decisions with a holistic, value-centric view. In the last few years, several …

CRAFT: A cache reduction architecture for flow tables in software-defined networks

X Li, W **e - 2017 IEEE Symposium on Computers and …, 2017 - ieeexplore.ieee.org
Software-Defined Networks (SDN) rely on flow tables to forward packets from different flows
with different policies. To speed up packet forwarding, the rules in the flow table should …

Taming the wildcards: Towards dependency-free rule caching with freecache

R Li, B Zhao, R Chen, J Zhao - 2020 IEEE/ACM 28th …, 2020 - ieeexplore.ieee.org
Wildcard rules are implemented in various important networking scenarios, including QoS,
firewall, access control, and network traffic monitoring and analysis. However, there are …

The knapsack problem with special neighbor constraints

S Goebbels, F Gurski, D Komander - Mathematical Methods of Operations …, 2022 - Springer
The knapsack problem is one of the simplest and most fundamental NP-hard problems in
combinatorial optimization. We consider two knapsack problems which contain additional …

Subset sum problems with digraph constraints

L Gourvès, J Monnot, L Tlilane - Journal of Combinatorial Optimization, 2018 - Springer
We introduce and study optimization problems which are related to the well-known Subset
Sum problem. In each new problem, a node-weighted digraph is given and one has to select …

Efficient Flow Table Caching Architecture and Replacement Policy for SDN Switches

X Li, H Sun, Y Huang - Journal of Network and Systems Management, 2024 - Springer
Software-defined networks (SDN) rely on flow tables to forward packets from different flows
with different policies. To speed up packet forwarding, the rules in the flow table should …