Valid inequalities and branch-and-cut for the clique pricing problem (Q665989)
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 6012789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Valid inequalities and branch-and-cut for the clique pricing problem |
scientific article; zbMATH DE number 6012789 |
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
0.8286358118057251
0 references
0.8088932633399963
0 references
0.7792730331420898
0 references
0.7584327459335327
0 references
