A branch and bound algorithm for the maximum diversity problem (Q2379521): 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.2008.12.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991805259 / rank | |||
Normal rank | |||
Revision as of 20:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the maximum diversity problem |
scientific article |
Statements
A branch and bound algorithm for the maximum diversity problem (English)
0 references
19 March 2010
0 references
maximum diversity problem
0 references
branch and bound
0 references
integer programming
0 references
