Multicriteria global minimum cuts
From MaRDI portal
Recommendations
- Multicriteria global minimum cuts
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Cardinality constrained and multicriteria (multi)cut problems
- scientific article; zbMATH DE number 176254
Cited in
(5)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Multicriteria global minimum cuts
- CUT: A Multicriteria Approach for Concavifiable Preferences
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
This page was built for publication: Multicriteria global minimum cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712178)