Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.04.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2098002863 / rank | |||
Normal rank | |||
Revision as of 20:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems |
scientific article |
Statements
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (English)
0 references
28 July 2015
0 references
metaheuristics
0 references
greedy algorithms
0 references
knapsack/covering problems
0 references
surrogate constraints
0 references
multi-start/strategic oscillation
0 references
tabu search
0 references
