A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
type: Item
instance of: scholarly article
title: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
zbMATH Open document ID: 1175.90248
author: D. Kharzeev
published in: Computers \& Operations Research
publication date: 2009-10-15T00:00:00Z
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5615432
zbMATH Keywords: nested partition
zbMATH Keywords: binary ant system
zbMATH Keywords: multidimensional knapsack
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: linear programming
MaRDI profile type: Publication
full work available at URL: j.cor.2009.04.015
OpenAlex ID: W1984243901
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: Q4821303
cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem
cites work: Nested Partitions Method for Global Optimization
cites work: Q5480099
cites work: Ant colonies for the quadratic assignment problem
cites work: Nested partitions method for stochastic optimization
cites work: New parallel randomized algorithms for the traveling salesman problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
DOI: 10.1016/J.COR.2009.04.015
Recommended article: Q2983735
Recommended article: An ant colony optimization approach for the multidimensional knapsack problem
Recommended article: A new ant colony optimization algorithm for the multidimensional Knapsack problem
Recommended article: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
Recommended article: Chapter 16 A Dynamic Optimisation Approach for Ant Colony Optimisation Using the Multidimensional Knapsack Problem
Recommended article: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Recommended article: A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
Recommended article: A hybrid method for solving nonlinear knapsack problems
description: scientific article; zbMATH DE number 5615432