RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039): 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.15807/jorsj.50.350 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2155985395 / rank | |||
Normal rank | |||
Latest revision as of 14:33, 19 March 2024
scientific article; zbMATH DE number 5269118
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) |
scientific article; zbMATH DE number 5269118 |
Statements
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (English)
0 references
29 April 2008
0 references
combinatorial optimization
0 references
set covering problem
0 references
linear programming
0 references
Lagrangian relaxation
0 references
subgradient method
0 references
heuristic algorithm
0 references
