Container-based microservice has emerged as a promising technique in promoting edge
computing elasticity. At the runtime, microservices, encapsulated in form of container …

Abstract The 0–1 multidimensional knapsack problem (MKP) arises in many fields of
optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an …

Edge computing has emerged as a powerful paradigm for efficient scheduling at the network
edge to fulfill users' requirements for low latency. Edge servers' and clouds' ability to interact …

The recent progresses in the development and improvement of multicore/manycore
architectures instigate the design of algorithms capable of exploring the functionalities …

The multidimensional 0–1 knapsack problem is a combinatorial optimization problem, which
is NP-hard and arises in many fields of optimization. Exact as well as heuristic methods exist …

Linear programming is a method for solving linear optimization problems with constraints,
widely met in real-world applications. In the vast majority of these applications, the number …

This paper introduces solutions to deal with the Multidimensional Knapsack Problem (MKP),
which is a NP-hard combinatorial optimisation problem. Two hybrid heuristics based on …

Redundancy identification techniques play an important role in improving the solvability of a
linear program. In this paper, we address the redundancy in multi-dimensional knapsack …

Important techniques in linear programming is modelling and solving practical optimization.
Redundant constraints are consider for their effects on general linear programming …

The multidimensional knapsack problem is a NP-hard, binary integer optimization problem
of finding a way of loading a set of knapsacks with items from a given set of items in a way to …