Extended cuts

DOI10.1007/s10878-014-9808-zzbMath1344.90052OpenAlexW2914374536MaRDI QIDQ266025

Walid Ben-Ameur, Mohamed Didi Biha

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9808-z

zbMATH Keywords

polyhedragraph partitioningcutcompact formulation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Extended cuts ⋮ A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended cuts
• Minimal multicut and maximal integer multiflow: a survey
• Finding good approximate vertex and edge partitions is NP-hard
• Optimal 3-terminal cuts and linear programming
• On the minimum cut separator problem
• Recent directions in netlist partitioning: a survey
• Approximation Algorithms for Steiner and Directed Multicuts
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• The Complexity of Multiterminal Cuts
• Multiway cuts in node weighted graphs

This page was built for publication: Extended cuts