Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134): Difference between revisions

Latest revision as of 21:45, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method	scientific article

Statements

instance of

scholarly article

0 references

title

Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (English)

0 references

zbMATH Open document ID

1251.90330

0 references

DOI

10.1016/j.cor.2011.10.016

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

15 November 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

heuristics

0 references

multidimensional knapsack

0 references

generalized upper bound

0 references

critical event tabu search

0 references

adaptive memory projection

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2011.10.016

0 references

OpenAlex ID

W2064214464

0 references

cites work

The Theory and Computation of Knapsack Functions

0 references

A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem

0 references

Combinatorial Auctions: A Survey

0 references

The 0-1 knapsack problem with multiple choice constraints

0 references

The Multiple-Choice Knapsack Problem

0 references

Towards the real time solution of strike force asset allocation problems

0 references

Heuristic algorithms for the multiple knapsack problem

0 references

Q4198056

0 references

Q5692642

0 references

Q4821303

0 references

The multidimensional 0-1 knapsack problem: an overview.

0 references

The multidimensional 0-1 knapsack problem -- bounds and computational aspects

0 references

Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

0 references

A heuristic algorithm for the multidimensional zero-one knapsack problem

0 references

A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems

0 references

Heuristic algorithms for the multiple-choice multidimensional knapsack problem

0 references

A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem

0 references

A heuristic solution procedure for the multiconstraint zero-one knapsack problem

0 references

Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

0 references

New greedy heuristics for the multiple-choice multi-dimensional knapsack problem

0 references

A column generation method for the multiple-choice multi-dimensional knapsack problem

0 references

Q4247468

0 references

A best first search exact algorithm for the multiple-choice multidimensional knapsack problem

0 references

A simulated annealing approach to the multiconstraint zero-one knapsack problem

0 references

A genetic algorithm for the multidimensional knapsack problem

0 references

An efficient tabu search approach for the 0-1 multidimensional knapsack problem

0 references

Q4350063

0 references

Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

0 references

Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints

0 references

A note on hashing functions and tabu search algorithms

0 references

Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem

0 references

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

0 references

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

0 references

Local branching

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1761134

@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Scatter Search
@@ Property / describes a project that uses: Scatter Search / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2011.10.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2064214464
@@ Property / OpenAlex ID: W2064214464 / rank @@
+Normal rank
@@ Property / cites work @@
+The Theory and Computation of Knapsack Functions
@@ Property / cites work: The Theory and Computation of Knapsack Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Combinatorial Auctions: A Survey
@@ Property / cites work: Combinatorial Auctions: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with multiple choice constraints
+Normal rank
@@ Property / cites work @@
+The Multiple-Choice Knapsack Problem
@@ Property / cites work: The Multiple-Choice Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Towards the real time solution of strike force asset allocation problems
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692642
@@ Property / cites work: Q5692642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+The multidimensional 0-1 knapsack problem: an overview.
+Normal rank
@@ Property / cites work @@
+The multidimensional 0-1 knapsack problem -- bounds and computational aspects
+Normal rank
@@ Property / cites work @@
+Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the multidimensional zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple-choice multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A heuristic solution procedure for the multiconstraint zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
+Normal rank
@@ Property / cites work @@
+New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A column generation method for the multiple-choice multi-dimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4247468
@@ Property / cites work: Q4247468 / rank @@
+Normal rank
@@ Property / cites work @@
+A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to the multiconstraint zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+An efficient tabu search approach for the 0-1 multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4350063
@@ Property / cites work: Q4350063 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
+Normal rank
@@ Property / cites work @@
+Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
+Normal rank
@@ Property / cites work @@
+A note on hashing functions and tabu search algorithms
+Normal rank
@@ Property / cites work @@
+Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Improved convergent heuristics for the 0-1 multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank