Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ro/2014054 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO/2014054 / rank | |||
Normal rank | |||
Latest revision as of 17:06, 30 December 2024
scientific article; zbMATH DE number 6472666
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems |
scientific article; zbMATH DE number 6472666 |
Statements
Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (English)
0 references
14 August 2015
0 references
multi-objective optimization
0 references
bound sets
0 references
combinatorial optimization
0 references
column generation
0 references
0 references
0 references
0 references
0 references
