Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
From MaRDI portal
Recommendations
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
Cites work
- scientific article; zbMATH DE number 3581927 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Algorithm for Large Zero-One Knapsack Problems
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An Enumeration Algorithm for Knapsack Problems
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Calculating surrogate constraints
- Computational results with a branch-and-bound algorithm for the general knapsack problem
- Computing Partitions with Applications to the Knapsack Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Quasi-Convex Programming
- Reduction Algorithm for Zero-One Single Knapsack Problems
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Mathematical Programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The Generalized Penalty-Function/Surrogate Model
- The Theory and Computation of Knapsack Functions
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The knapsack problem: A survey
- Topological design of centralized computer networks—formulations and algorithms
- Validation of subgradient optimization
- Zero-one programming with many variables and few constraints
Cited in
(86)- Addressing capacity uncertainty in resource-constrained assignment problems
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Optimization by ghost image processes in neural networks
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
- An exact algorithm for bilevel 0-1 knapsack problems
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- A survey of algorithms for the generalized assignment problem
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Future paths for integer programming and links to artificial intelligence
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- A surrogate heuristic for set covering problems
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- Capacity allocation problem with random demands for the rail container carrier
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- Dynamic tabu list management using the reverse elimination method
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- Heuristics for the multi-resource generalized assignment problem
- Bi-dimensional knapsack problems with one soft constraint
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Piecewise convex maximization approach to multiknapsack
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Modeling multiple plant sourcing decisions
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- MineReduce: an approach based on data mining for problem size reduction
- An improved typology of cutting and packing problems
- Intelligent water drops algorithm
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Heuristics 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
- Part type selection problem in flexible manufacturing systems: Tabu search algorithms
- Improved results on the 0--1 multidimensional knapsack problem
- An efficient algorithm to allocate shelf space
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Essential particle swarm optimization queen with tabu search for MKP resolution
- The multidimensional 0-1 knapsack problem: an overview.
- A solution procedure for general knapsack problems with a few constraints
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- \(0\)-\(1\) knapsack problems with a side constraint
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- A contraction for the multiparametric integer linear programming problem
- A trust branching path heuristic for zero-one programming
- Algorithmic Applications in Management
- A surrogate and Lagrangian approach to constrained network problems
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Configuration of fully replicated distributed database system over wide area networks
- On generalized surrogate duality in mixed-integer nonlinear programming
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- The zero-one knapsack problem with equality constraint
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- 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
- An improved enumeration for pure 0-1 programs
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- scientific article; zbMATH DE number 438310 (Why is no real title available?)
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- An integer programming model for the allocation of databases in a distributed computer system
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Surrogate Constraints in Integer Programming
- Using fuzzy numbers in knapsack problems
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
This page was built for publication: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688105)
