Results 171 to 180 of about 417,011 (184)
Some of the next articles are maybe not open access.
Mixed integer lifted cover inequalities for knapsack problems with a single continuous variable
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013We present a separation procedure for a class of valid inequalities (mixed lifted cover inequalities) for the mixed binary knapsack set with a single continuous variable. It consists of the following steps: (i) the continuous variable is fixed to a given value, (ii) a valid inequality for the corresponding binary knapsack set is computed, (iii) the ...
P Avella, M Boccia, S Mattia
openaire +3 more sources
Conference on Integer Programming and Combinatorial Optimization, 2014
Alejandro Angulo Cardenas +2 more
semanticscholar +1 more source
Alejandro Angulo Cardenas +2 more
semanticscholar +1 more source
An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem
Engineering computations, 2021Benyamin Abdollahzadeh +3 more
semanticscholar +1 more source
A Binary Firefly Algorithm Applied to Knapsack Problem
Artificial Intelligence in Intelligent Systems, 2021H. Pinto +4 more
semanticscholar +1 more source
A combinatorial algorithm for inverse continuous quadratic knapsack problem
Mathematical Methods of Operations ResearchN. Toan +3 more
semanticscholar +1 more source
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
European Journal of Operational Research, 2000Martin Savelsbergh
exaly
The robust bilevel continuous knapsack problem.
CoRR, 2019Christoph Buchheim, Dorothee Henke
openaire +1 more source