EconPapers    
Economics at your fingertips  
 

Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron

F. Bendali () and J. Mailfert ()
Additional contact information
F. Bendali: Complexe Scientifique des Cézeaux
J. Mailfert: Complexe Scientifique des Cézeaux

Journal of Combinatorial Optimization, 2009, vol. 18, issue 1, No 1, 22 pages

Abstract: Abstract This paper studies the graphs for which the linear relaxation of the 2-connected spanning subgraph polyhedron has integer or half-integer extreme points. These graphs are called quasi-integer. For these graphs, the linear relaxation of the k-edge connected spanning subgraph polyhedron is integer for all k=4r, r≥1. The class of quasi-integer graphs is closed under minors and contains for instance the class of series-parallel graphs. We discuss some structural properties of graphs which are minimally non quasi-integer graphs, then we examine some basic operations which preserve the quasi-integer property. Using this, we show that the subdivisions of wheels are quasi-integer.

Keywords: k-edge connectivity; Half integrality; Polyhedron; Linear relaxation; Forbidden minors (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9134-9 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:18:y:2009:i:1:d:10.1007_s10878-007-9134-9

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

DOI: 10.1007/s10878-007-9134-9

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

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:18:y:2009:i:1:d:10.1007_s10878-007-9134-9