Branch-decomposition

Results: 32



#Item
1Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2012-05-06 07:54:01
265  Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

65 Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-07-25 10:24:42
3

PDF Document

Add to Reading List

Source URL: www.zib.de

Language: English - Date: 2010-10-28 06:01:03
4Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1  Brown University, United States

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1 Brown University, United States

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-02-19 14:45:50
5Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2005-07-07 11:28:02
6Weighted Constraint Satisfaction Problems with Min-Max Quantifiers∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong {jlee,wk

Weighted Constraint Satisfaction Problems with Min-Max Quantifiers∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong {jlee,wk

Add to Reading List

Source URL: www.tmak.info

Language: English - Date: 2013-10-06 08:30:44
7Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 06:03:49
8Asia Pacific Mathematics Newsletter 1 Rota’s Rota’sConjecture Conjecture

Asia Pacific Mathematics Newsletter 1 Rota’s Rota’sConjecture Conjecture

Add to Reading List

Source URL: www.asiapacific-mathnews.com

Language: English - Date: 2014-02-27 03:53:21
9Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2008-02-12 04:44:10
10A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger †

A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger †

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:53