Valid inequalities and branch-and-cut for the clique pricing problem (Q665989): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:07, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Valid inequalities and branch-and-cut for the clique pricing problem |
scientific article |
Statements
Valid inequalities and branch-and-cut for the clique pricing problem (English)
0 references
7 March 2012
0 references
network pricing
0 references
mixed integer programming
0 references
combinatorial optimization
0 references
clique
0 references
