A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (Q3945965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory |
scientific article; zbMATH DE number 3763694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory |
scientific article; zbMATH DE number 3763694 |
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
