A genetic algorithm for the multidimensional knapsack problem
From MaRDI portal
Publication:1273651
DOI10.1023/A:1009642405419zbMath0913.90218OpenAlexW1586409345MaRDI QIDQ1273651
Publication date: 6 January 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009642405419
Related Items (only showing first 100 items - show all)
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX® ⋮ Separation algorithms for 0-1 knapsack polytopes ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners ⋮ Optimal targeted mass screening in non‐uniform populations with multiple tests and schemes ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Intelligent water drops algorithm ⋮ Modeling multiple plant sourcing decisions ⋮ Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem ⋮ Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ An Optimal Strategy for the Constrained Cycle Cover Problem ⋮ Values Suggestion in Mixed Integer Programming by Machine Learning Algorithm ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ A mathematical model for selecting mixed models with due dates ⋮ A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base ⋮ A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems ⋮ Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method ⋮ Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence ⋮ High generalization performance structured self-attention model for knapsack problem ⋮ An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem ⋮ A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ A randomized heuristic repair for the multidimensional knapsack problem ⋮ The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Decomposition based hybrid metaheuristics ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Smallest covering regions and highest density regions for discrete distributions ⋮ The fractional multidimensional knapsack problem: solution and uniqueness ⋮ 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 RNN-based hyper-heuristic for combinatorial problems ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 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 ⋮ 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 ⋮ A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation ⋮ An ant colony optimization approach for binary knapsack problem under fuzziness ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ Improving an exact approach for solving separable integer quadratic knapsack problems ⋮ 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 memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ 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. ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ Scatter search for the 0-1 multidimensional knapsack problem ⋮ Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem ⋮ Approximate policy iteration for dynamic resource-constrained project scheduling ⋮ A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems ⋮ Geometricity of genetic operators for real-coded representation ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ A genetic algorithm with fuzzy crossover operator and probability ⋮ 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 ⋮ 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 ⋮ Two new reformulation convexification based hierarchies for 0-1 MIPs ⋮ Bringing order into the neighborhoods: Relaxation guided variable neighborhood search ⋮ \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities ⋮ A new exact approach for the 0-1 collapsing knapsack problem ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ Fast, effective heuristics for the 0-1 multi-dimensional 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 ⋮ Lagrangian relaxation and constraint generation for allocation and advanced scheduling ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ 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) ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ An exact algorithm for the knapsack sharing problem ⋮ NeuroGenetic approach for combinatorial optimization: an exploratory analysis ⋮ Sampled fictitious play for approximate dynamic programming ⋮ Alternating control tree search for knapsack/covering problems ⋮ Adaptive memory search for multidemand multidimensional knapsack problems ⋮ Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem ⋮ 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 0-1 knapsack problems based on amoeboid organism algorithm ⋮ \(\text{MA}\mid\text{PM}\): memetic algorithms with population management ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization
Uses Software
This page was built for publication: A genetic algorithm for the multidimensional knapsack problem
