Maximizing a class of submodular utility functions with constraints (Q517299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6696634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing a class of submodular utility functions with constraints |
scientific article; zbMATH DE number 6696634 |
Statements
Maximizing a class of submodular utility functions with constraints (English)
0 references
23 March 2017
0 references
submodularity
0 references
cutting planes
0 references
lifting
0 references
mixed integer nonlinear programming
0 references
branch-and-cut
0 references
0 references
0.96282417
0 references
0.9427855
0 references
0.92542017
0 references
0.91625655
0 references
0.9126836
0 references
0.91103876
0 references
0 references
0.9100679
0 references
