Persistency and matroid intersection

• Cechlárova K (1998). Persistency in the assignment and transportation problems. Math Methods Oper Res 47: 243–254

  Article  Google Scholar 

• Cechlárova K and Lacko V (2001). Persistency in combinatorial optimization problems on matroids. Discrete Appl Math 110: 121–132

  Article  Google Scholar 

• Costa MC (1994). Persistency in maximum cardinality bipartite matchings. Oper Res Lett 15: 143–149

  Article  Google Scholar 

• Fekete SP, Firla RT and Spille B (2003). Characterizing matchings as the intersection of matroids. Math Methods Oper Res 58: 319–329

  Article  Google Scholar 

• Frank A (1981). A weighted matroid intersection algorithm. J Algorithms 2: 328–336

  Article  Google Scholar 

• Hammer PL, Hansen P and Simeones B (1982). Vertices belonging to all or to no maximum stable sets of a graph. SIAM J Algebr Discrete Math 4: 511–522

  Article  Google Scholar 

• Hammer PL, Hansen P and Simeones B (1984). Roof duality, complementation and persistency in quadratic 0-1 optimization. Math Program 28: 121–155

  Article  Google Scholar 

• Kashiwabara K, Okamoto Y, Uno T (2003) Matroid representation of clique complexes. In: Proceedings of Cocoon 2003, LNCS 2697, pp 192–201

• Korte B and Vygen J (2002). Combinatorial optimization: theory and algorithms. Springer, Heidelberg

  Google Scholar 

• Lawler E (1976). Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York

  Google Scholar 

• Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-Completness. W.H. Freeman, San Francisco

• Oxley JG (1992). Matroid theory. Oxford University Press, Oxford

  Google Scholar 

• Régin JC (1994) A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the AAAI-94, pp 362–367

Download references