A new algorithm for the 0-1 knapsack problem

Composition for multivariate random variables

WSC '94 Proceedings of the 26th conference on Winter simulation

Properties of synthetic optimization problems

Proceedings of the 30th conference on Winter simulation

Input models for synthetic optimization problems

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

Artificial Intelligence for Engineering Design, Analysis and Manufacturing

Where are the hard knapsack problems?

Computers and Operations Research

Examining the Role of "Free" Product-Augmenting Online Services in Pricing and Customer Retention Strategies

Journal of Management Information Systems

Core problems in bi-criteria {0,1}-knapsack problems

Computers and Operations Research

The core concept for 0/1 integer programming

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77

Synthetic Optimization Problem Generation: Show Us the Correlations!

INFORMS Journal on Computing

Enhanced quantum evolutionary algorithms for difficult knapsack problems

PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence

Local branching-based algorithms for the disjunctively constrained knapsack problem

Computers and Industrial Engineering

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Journal of Global Optimization

Simulating realistic set covering problems with known optimal solutions

Computers and Industrial Engineering

Problem reduction heuristic for the 0-1 multidimensional knapsack problem

Computers and Operations Research

An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem

Computers and Operations Research

Solving the hard knapsack problems with a binary particle swarm approach

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III

An efficient algorithm for the collapsing knapsack problem

Information Sciences: an International Journal

The core concept for the multidimensional knapsack problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes

Discrete Optimization

Note: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

Discrete Optimization

An exact algorithm for large unbounded knapsack problems

Operations Research Letters

Multicriteria 0-1 knapsack problems with k-min objectives

Computers and Operations Research