Parking edge computing: Parked-vehicle-assisted task offloading for urban VANETs
C Ma, J Zhu, M Liu, H Zhao, N Liu… - IEEE Internet of Things …, 2021 - ieeexplore.ieee.org
Vehicular edge computing has been a promising paradigm to offer low-latency and high
reliability vehicular services for users. Nevertheless, for compute-intensive vehicle …
reliability vehicular services for users. Nevertheless, for compute-intensive vehicle …
[HTML][HTML] The 0/1 multidimensional knapsack problem and its variants: A survey of practical models and heuristic approaches
S Laabadi, M Naimi, H El Amri, B Achchab - American Journal of …, 2018 - scirp.org
The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard
combinatorial optimization problem that can model a number of challenging applications in …
combinatorial optimization problem that can model a number of challenging applications in …
A “reduce and solve” approach for the multiple-choice multidimensional knapsack problem
The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard
combinatorial optimization problem with a number of important applications. In this paper …
combinatorial optimization problem with a number of important applications. In this paper …
An ant colony optimization algorithm for waste collection vehicle routing with time windows, driver rest period and multiple disposal facilities
In this paper we consider a real life waste collection problem that can be seen as a variant of
the vehicle routing problem with time windows. In this problem there is a set of clients to be …
the vehicle routing problem with time windows. In this problem there is a set of clients to be …
A hybrid heuristic for the multiple choice multidimensional knapsack problem
R Mansi, C Alves, JM Valerio de Carvalho… - Engineering …, 2013 - Taylor & Francis
In this article, a new solution approach for the multiple choice multidimensional knapsack
problem is described. The problem is a variant of the multidimensional knapsack problem …
problem is described. The problem is a variant of the multidimensional knapsack problem …
Solving the multiple choice multidimensional knapsack problem with ABC algorithm
A Mkaouar, S Htiouech… - 2020 IEEE Congress on …, 2020 - ieeexplore.ieee.org
The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an NP-hard problem.
Many heuristics algorithms have been developed to solve this combinatorial optimization …
Many heuristics algorithms have been developed to solve this combinatorial optimization …
[HTML][HTML] A big data approach for demand response management in smart grid using the prophet model
Smart Grids (SG) generate extensive data sets regarding the system variables, viz., and
demand and supply. These extremely large data sets are known as big data. Hence …
demand and supply. These extremely large data sets are known as big data. Hence …
A set partitioning reformulation for the multiple-choice multidimensional knapsack problem
S Voß, E Lalla-Ruiz - Engineering Optimization, 2016 - Taylor & Francis
The Multiple-choice Multidimensional Knapsack Problem (MMKP) is a well-known-hard
combinatorial optimization problem that has received a lot of attention from the research …
combinatorial optimization problem that has received a lot of attention from the research …
Throughput-aware RRHs clustering in cloud radio access networks
Cloud-Radio Access Network (C-RAN) is an attractive solution to Mobile Network Operators.
Firstly, C-RAN leverages the effect of pooling multiple Baseband Units (BBUs) to offer …
Firstly, C-RAN leverages the effect of pooling multiple Baseband Units (BBUs) to offer …
Comparing various genetic algorithm approaches for multiple-choice multi-dimensional knapsack problem (mm-KP)
One of the essential and well-known classes of combinatorial optimization problems
commonly studies by researchers in the last five decades is called the Knapsack Problem …
commonly studies by researchers in the last five decades is called the Knapsack Problem …