A Lagrangian-based heuristic for large-scale set covering problems (Q1290617): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01581106 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091836882 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian-based heuristic for large-scale set covering problems |
scientific article |
Statements
A Lagrangian-based heuristic for large-scale set covering problems (English)
0 references
5 September 1999
0 references
primal-dual Lagrangian
0 references
subgradient algorithms
0 references
0-1 programming
0 references
approximate solutions
0 references
railways
0 references
Italian railways
0 references
Lagrangian-based heuristic
0 references
large-scale set-covering problems
0 references
crew-scheduling
0 references
0 references
0 references
