Extended cuts

Walid Ben-Ameur () and Mohamed Didi Biha ()
Additional contact information
Walid Ben-Ameur: Télécom SudParis
Mohamed Didi Biha: Université de Caen

Journal of Combinatorial Optimization, 2016, vol. 31, issue 3, No 7, 1034-1044

Abstract: Abstract Given a directed graph $$G=(V,A)$$ G = ( V , A ) , three positive integers $$r$$ r , $$k$$ k and $$k'$$ k ′ , and a partition $$\{V_0, V_1,\ldots ,V_r\}$$ { V 0 , V 1 , … , V r } of $$V$$ V such that there are no arcs from $$V_i$$ V i to $$V_j$$ V j when $$j-i>k$$ j - i > k or $$j-i

Keywords: Graph partitioning; Cut; Polyhedra; Compact formulation; 90C27; 90C57 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9808-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9808-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9808-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().