A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

DOI10.1007/978-3-319-07557-0_3zbMath1418.90209OpenAlexW2224861772MaRDI QIDQ5418982

S. Thomas McCormick, Maurice Queyranne, Hassene Aissi, Ali Ridha Mahjoub

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_3

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (2)

Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs

This page was built for publication: A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts