Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs |
scientific article |
Statements
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (English)
0 references
9 December 2015
0 references
multiobjective optimization
0 references
parametric optimization
0 references
global minimum cut
0 references
0 references