Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
The Knapsack Problem with forfeit sets
This work introduces a novel extension of the 0/1 Knapsack Problem in which we consider
the existence of so-called forfeit sets. A forfeit set is a subset of items of arbitrary cardinality …
the existence of so-called forfeit sets. A forfeit set is a subset of items of arbitrary cardinality …
A hybrid metaheuristic for the knapsack problem with forfeits
In this paper, we present a novel hybrid metaheuristic for the Knapsack Problem with Forfeits
(KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a …
(KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a …
The multiple multidimensional knapsack with family-split penalties
Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties
(MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and …
(MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and …
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of
the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices …
the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices …
[HTML][HTML] New exact approaches and approximation results for the penalized knapsack problem
Abstract We consider the 0–1 Penalized Knapsack Problem (PKP). Each item has a profit, a
weight and a penalty and the goal is to maximize the sum of the profits minus the greatest …
weight and a penalty and the goal is to maximize the sum of the profits minus the greatest …
Integer optimization with penalized fractional values: The Knapsack case
We consider integer optimization problems where variables can potentially take fractional
values, but this occurrence is penalized in the objective function. This general situation has …
values, but this occurrence is penalized in the objective function. This general situation has …
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems
This paper considers a general class of continuous, nonlinear, and nonseparable knapsack
problems, special cases of which arise in numerous operations and financial contexts. We …
problems, special cases of which arise in numerous operations and financial contexts. We …
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular
items of given size into a strip of given width divided into levels. Items packed into the same …
items of given size into a strip of given width divided into levels. Items packed into the same …
Severity-based prioritized processing of packets with application in VANETs
To fully realize the potential of vehicular networks, several obstacles and challenges need to
be addressed. Chief among the obstacles are strict QoS requirements of applications and …
be addressed. Chief among the obstacles are strict QoS requirements of applications and …