Results 91 to 100 of about 24,926 (205)

Reoptimization in lagrangian methods for the quadratic knapsack problem

, 2012
International audienceThe 0-1 quadratic knapsack problem consists in maximizing a quadratic objective function subject to a linear capacity constraint. To solve exactly large instances of this problem with a tree search algorithm (e.g. a branch and bound
Létocart, Lucas, Nagih, Anass, Plateau, Gérard   +2 more
core   +1 more source

An Improved Shuffled Frog-Leaping Algorithm to Solving 0–1 Knapsack Problem

IEEE Access
To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal ...
Jianhao Zhang, Wei Jiang, Kang Zhao
doaj   +1 more source

An empirical study of tabu search for the mokp [PDF]

, 2002
International audienceThree Tabu Search algorithms are presented for the 0-1 multi-dimensional multi-objective knapsack problem. Experiments are carried out to study the role of different diversification techniques for TS and to compare TS with well ...
J.K. Hao, V. Barichard
core   +1 more source

Cargo Revenue Management: Bid-Prices for a 0-1 Multi Knapsack Problem [PDF]

, 2004
Revenue management is the practice of selecting those customers that generate the maximum revenue from a fixed and perishable capacity. Cargo revenue management differs from the well-known passenger revenue management problem by the fact that its ...
Dekker, R. (Rommert), Pak, K.
core   +1 more source

CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM

Вісник Київського національного університету імені Тараса Шевченка. Серія Економіка, 2014
In this research paper, we shall consider the application of classical 0-1 knapsack problem with a single constraint to selection of television advertisements at critical periods such as prime time news, news adjacencies, break in news and peak times ...
E. Ivokhin, Almodars Barraq Subhi Kaml
doaj   +1 more source

Cell Selection and Resource Allocation in LTE-Advanced Heterogeneous Networks

IEEE Access, 2018
A LTE-advanced heterogeneous network consists of many macrocells, and within each macrocell, there can have many picocells and user equipments (UEs). A UE within a macrocell can request resource blocks (RBs) from either the macrocell or a picocell within
Wei Kuang Lai, Jinu-Kuen Liu
doaj   +1 more source

An exact algorithm for the 0–1 collapsing knapsack problem

Discrete Applied Mathematics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fayard, Didier, Plateau, Gérard
openaire   +1 more source

Binary Puma Optimizer: A Novel Approach for Solving 0-1 Knapsack Problems and the Uncapacitated Facility Location Problem

Applied Sciences
In this study, the Binary Puma Optimizer (BPO) is introduced as a novel binary metaheuristic. The BPO employs eight Transfer Functions (TFs), consisting of four S-shaped and four V-shaped mappings, to convert the continuous search space of the original ...
Aysegul Ihsan, Tahir Sag
doaj   +1 more source

Knowledge-based Genetic Algorithm for the 0-1 Multidimensional Knapsack Problem [PDF]

, 2017
Rezoug, Abdellah, Bader-El-Den, Mohamed, Boughaci, Dalila   +2 more
core   +3 more sources

An Intelligent Method for Customizable Adaptive Learning Content Generation

International Journal of Information and Communication Technology Research, 2011
E-learning environments are being used more efficiently by the rapid growth in internet and multimedia technologies. Adaptive learning is a kind of learning environment which provides individual learning.
Ehsan Haghshenas, Arya Mazaheri, Ameneh Gholipour, Maryam Tavakoli   +3 more
doaj