A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
From MaRDI portal
Cited in
(58)- A trust branching path heuristic for zero-one programming
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Zero-one integer programs with few contraints - lower bounding theory
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Decentralization of responsibility for site decontamination projects: A budget allocation approach
- The multidimensional 0-1 knapsack problem: an overview.
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Dichotomous binary differential evolution for knapsack problems
- Heuristic methods and applications: A categorized survey
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Novel binary differential evolution algorithm for knapsack problems
- Gompertz PSO variants for knapsack and multi-knapsack problems
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Using fuzzy numbers in knapsack problems
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- Analysis and improvement of the binary particle swarm optimization
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Multiple solutions for combinatorial optimization via k-NN Hamming distance niching
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Model and algorithms for multi-period sea cargo mix problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Alternating control tree search for knapsack/covering problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
This page was built for publication: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198334)
