Maximizing a class of submodular utility functions with constraints (Q517299): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C11 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6696634 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
submodularity | |||
Property / zbMATH Keywords: submodularity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cutting planes | |||
Property / zbMATH Keywords: cutting planes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
lifting | |||
Property / zbMATH Keywords: lifting / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
mixed integer nonlinear programming | |||
Property / zbMATH Keywords: mixed integer nonlinear programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
branch-and-cut | |||
Property / zbMATH Keywords: branch-and-cut / rank | |||
Normal rank |
Revision as of 05:28, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing a class of submodular utility functions with constraints |
scientific article |
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