A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem

DOI10.1016/j.cor.2009.04.015zbMath1175.90248OpenAlexW1984243901MaRDI QIDQ732881

D. Kharzeev

Publication date: 15 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.015

zbMATH Keywords

linear programmingcombinatorial optimizationbinary ant systemmultidimensional knapsacknested partition

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70)

Related Items (5)

Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal

Cites Work

• Unnamed Item
• Unnamed Item
• A genetic algorithm for the multidimensional knapsack problem
• New parallel randomized algorithms for the traveling salesman problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved results on the 0--1 multidimensional knapsack problem
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• Ant colonies for the quadratic assignment problem
• Nested Partitions Method for Global Optimization
• Nested partitions method for stochastic optimization

This page was built for publication: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem