A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
From MaRDI portal
Publication:4198334
DOI10.2307/3009639zbMath0411.90050OpenAlexW4256528411MaRDI QIDQ4198334
Publication date: 1979
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3009639
computational experiencecomparison of algorithmsbranch and bound methodboolean programmingalgorithmic performanceInteger Programmingbalas methodgeneralized knapsack problemsearch processestimation of the upper boundm-constraint knapsack problem
Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, A simulated annealing approach to the multiconstraint zero-one knapsack problem, Model and algorithms for multi-period sea cargo mix problem, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment, A Modified Binary Particle Swarm Optimization for Knapsack Problems, Decentralization of responsibility for site decontamination projects: A budget allocation approach, An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, The multidimensional 0-1 knapsack problem: an overview., Interdiction Games and Monotonicity, with Application to Knapsack Problems, 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, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, 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, A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem, Bringing order into the neighborhoods: Relaxation guided variable neighborhood search, Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Greedy algorithm for the general 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, 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, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, An ant colony optimization approach for the multidimensional knapsack problem, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Improved results on the 0--1 multidimensional knapsack problem, Using fuzzy numbers in knapsack problems, Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems, A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem, Dichotomous binary differential evolution for knapsack problems, A trust branching path heuristic for zero-one programming, CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem, Novel binary differential evolution algorithm for knapsack problems, Heuristic methods and applications: A categorized survey, Gompertz PSO variants for knapsack and multi-knapsack problems, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Zero-one integer programs with few contraints - lower bounding theory, Revisiting surrogate relaxation for the multidimensional knapsack problem, Heuristics and reduction methods for multiple constraints 0-1 linear programming problems, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Zero-one integer programs with few constraints - Efficient branch and bound algorithms, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
