A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (Q3945965)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory |
scientific article |
Statements
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (English)
0 references
1982
0 references
network flow technique
0 references
unconstrained nonlinear 0-1 programming
0 references
ratio of two polynomials
0 references
investment selection
0 references
sequence of minimum-cut problems
0 references
bounding scheme
0 references
maximum-clique
0 references
vertex packing
0 references
