A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
DOI10.1016/J.COR.2009.04.015zbMATH Open1175.90248OpenAlexW1984243901MaRDI QIDQ732881FDOQ732881
Authors: 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
Recommendations
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- A hybrid method for solving nonlinear knapsack problems
linear programmingcombinatorial optimizationbinary ant systemmultidimensional knapsacknested partition
Linear programming (90C05) Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Ant colonies for the quadratic assignment problem
- Ant colony optimization.
- Nested Partitions Method for Global Optimization
- Improved results on the 0--1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Nested partitions method for stochastic optimization
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- New parallel randomized algorithms for the traveling salesman problem
Cited In (12)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A hybrid distribution estimation algorithm for solving multidimensional knapsack problems
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model
- Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Yard crane scheduling in the ground trolley-based automated container terminal
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An ant colony optimization approach for the multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
This page was built for publication: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732881)
