Valid inequalities and branch-and-cut for the clique pricing problem (Q665989): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.01.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090914983 / rank | |||
Normal rank | |||
Revision as of 03:32, 20 March 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
