Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case |
scientific article; zbMATH DE number 1252883
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case |
scientific article; zbMATH DE number 1252883 |
Statements
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (English)
0 references
27 April 1999
0 references
quadratic cost partition
0 references
submodular function
0 references
mixed-integer programming
0 references
valid inequalities
0 references
node packing polyhedron
0 references
