Even Cycles and Perfect Matching Problems with Side Constraints

Elena Fernández () and Oscar Meza ()
Additional contact information
Elena Fernández: Universitat Politècnica de Catalunya
Oscar Meza: Simón Bolívar University

Journal of Combinatorial Optimization, 2004, vol. 8, issue 3, No 8, 396 pages

Abstract: Abstract We study two different types of graphs that contain even cycles and, possibly, some chords. The objective is to analyze some properties of these types of graphs that can be used to solve perfect matching optimization problems with side constraints. In particular, we obtain the maximum number of edges of certain classes that can occur in the solutions to the considered problems. Finally, we apply the obtained results to derive a class of valid inequalities and a possible enumerative scheme.

Keywords: matching problems; even cycles; valid inequalities (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000038916.51082.5e 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:8:y:2004:i:3:d:10.1023_b:joco.0000038916.51082.5e

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

DOI: 10.1023/B:JOCO.0000038916.51082.5e

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 ().