Extended cuts

DOI10.1007/S10878-014-9808-ZMaRDI QIDQ266025zbMATH OpenOpenAlexFDO

Authors 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

graph partitioningpolyhedracompact formulationcut

Mathematics Subject Classification ID

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

Recommendations

• Extension without cut
• Extension operations for cuts
• The final cut
• Cutting Out Continuations
• Covering directed and odd cuts
• Multi-budgeted directed cuts
• Multi-budgeted directed cuts
• Cutting the mix
• Cuts and bounds
• Cuts and gluts

Cites work

• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1775387 (Why is no real title available?)
• Approximation Algorithms for Steiner and Directed Multicuts
• Extended cuts
• Finding good approximate vertex and edge partitions is NP-hard
• Minimal multicut and maximal integer multiflow: a survey
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Multiway cuts in node weighted graphs
• On the minimum cut separator problem
• Optimal 3-terminal cuts and linear programming
• Recent directions in netlist partitioning: a survey
• The Complexity of Multiterminal Cuts

Cited in

(4)

• Extended cuts
• Extended rate, more GFUN
• Covering directed and odd cuts
• A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues

This page was built for publication: Extended cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266025)