Valid inequalities and branch-and-cut for the clique pricing problem (Q665989): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2011.01.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2011.01.001 / rank | |||
Normal rank | |||
Latest revision as of 00:25, 10 December 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
0 references
