A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:1956060
DOI10.1155/2013/474852zbMath1264.90150OpenAlexW1976900421WikidataQ58921611 ScholiaQ58921611MaRDI QIDQ1956060
Publication date: 13 June 2013
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/474852
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A new adaptive multi-start technique for combinatorial global optimizations
- The multidimensional 0-1 knapsack problem: an overview.
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Obtaining test problems via Internet
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
This page was built for publication: A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
