A genetic algorithm for the multidimensional knapsack problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A two-stage model for a day-ahead paratransit planning problem
- A trust branching path heuristic for zero-one programming
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Global optimization and multi knapsack: a percolation algorithm.
- Two genetic algorithms to solve a layout problem in the fashion industry
- The multidimensional 0-1 knapsack problem: an overview.
- Heuristics for cardinality constrained portfolio optimization
- A framework for the description of evolutionary algorithms
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
- A genetic algorithm to solve the multidimensional knapsack problem
- Bridging \(k\)-sum and CVaR optimization in MILP
- Approximate policy iteration for dynamic resource-constrained project scheduling
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- A new exact approach for the 0-1 collapsing 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
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Improved results on the 0--1 multidimensional knapsack problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- A dual heuristic for mixed integer programming
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Cooperative multiobjective optimization with bounds on objective functions
- Complexity indices for the multidimensional knapsack problem
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Smallest covering regions and highest density regions for discrete distributions
- The fractional multidimensional knapsack problem: solution and uniqueness
- A RNN-based hyper-heuristic for combinatorial problems
- Dual mean field annealing scheme for binary optimization under linear constraints
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
- Problems of discrete optimization: challenges and main approaches to solve them
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- An exact algorithm for the knapsack sharing problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- An optimal strategy for the constrained cycle cover problem
- Values suggestion in mixed integer programming by machine learning algorithm
- scientific article; zbMATH DE number 1703850 (Why is no real title available?)
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
- A multiple bits greedy mutation-based genetic algorithm for knapsack problem
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
- scientific article; zbMATH DE number 2086191 (Why is no real title available?)
- Decomposition based hybrid metaheuristics
- Robust efficiency measures for linear knapsack problem variants
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A hybrid genetic algorithm for the multidimensional knapsack problem
- Intelligent water drops algorithm
- Modeling multiple plant sourcing decisions
- Simulated annealing for the 0/1 multidimensional knapsack problem
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation
- Improving an exact approach for solving separable integer quadratic knapsack problems
- scientific article; zbMATH DE number 1114464 (Why is no real title available?)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- A mathematical model for selecting mixed models with due dates
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- scientific article; zbMATH DE number 1784908 (Why is no real title available?)
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
This page was built for publication: A genetic algorithm for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273651)
