Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem [PDF]
, 2007 The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combinatorial optimization problem with many applications.
Kaparis, Konstantinos +2 more
core +5 more sources
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core +6 more sources
Separation algorithms for 0-1 knapsack polytopes [PDF]
, 2010 Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated.
Letchford, Adam, Kaparis, Konstantinos
core +4 more sources
New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]
, 2010 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core +7 more sources
Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem
Mathematics, 2021 The knapsack problem is one of the most widely researched NP-complete combinatorial optimization problems and has numerous practical applications. This paper proposes a quantum-inspired differential evolution algorithm with grey wolf optimizer (QDGWO) to
Yule Wang, Wanliang Wang
doaj +1 more source
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem [PDF]
, 2008 An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the ...
Salhi, Said +2 more
core +1 more source
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Entropy, 2014 Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems.
Zhaolu Guo +4 more
doaj +1 more source
Novel Discrete Differential Evolution Algorithm for Solving D{0-1}KP Problem [PDF]
Jisuanji kexue yu tansuo, 2022 The discounted {0-1} knapsack problem (D{0-1}KP) is a more complex variant of the classic 0-1 knap-sack problem (0-1KP). In order to efficiently solve the D{0-1}KP by using discrete differential evolution algorithm, firstly, a novel V-shape transfer ...
ZHANG Fazhan, HE Yichao, LIU Xuejing, WANG Zekun
doaj +1 more source
IEEE Access, 2019 The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang +4 more
doaj +1 more source
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem [PDF]
, 2022 We consider a stochastic version of the 0–1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack.
Santini A., Pike-Burke C., Monaci M.
core +3 more sources