Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions (Q5391895): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2585345288 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4530019 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4821303 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4473059 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms / rank | |||
Normal rank | |||
Latest revision as of 22:32, 3 July 2024
scientific article; zbMATH DE number 5875887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions |
scientific article; zbMATH DE number 5875887 |
Statements
Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions (English)
0 references
7 April 2011
0 references
