AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system 12Ax≥1,x≥0 is box totally dual integral (box-TDI) if and only if G is a series-parallel graph; a by-product of this characterization is a structural description of a box-TDI system on matroids. Our results strengthen two previous theorems obtained respectively by Cornuéjols, Fonlupt, and Naddef and by Mahjoub which assert that both polyhedra {x∣12Ax≥1,x≥0} and {x∣12Ax≥1,1≥x≥0} are integral if G is series-parallel
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
AbstractWe prove that each (rational) polyhedron of full dimension is determined by a unique minimal...
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. ...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
In this thesis we study integer total dual integral (TDI) systems and box-totally dualintegral (box-...
Given a connected graph G=(V,E) and an integer (formula presented), the connected graph H=(V,F) wher...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
Let M be a matroid on E ∪ {l}, where l ∉ E is a distinguished element of M. The l-port of M is the s...
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We sh...
Let M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
A hypergraph is called box-Mengerian if the linear system Ax ≥ 1, x ≥ 0 is box-totally dual integral...
Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
AbstractWe prove that each (rational) polyhedron of full dimension is determined by a unique minimal...
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. ...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
In this thesis we study integer total dual integral (TDI) systems and box-totally dualintegral (box-...
Given a connected graph G=(V,E) and an integer (formula presented), the connected graph H=(V,F) wher...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
Let M be a matroid on E ∪ {l}, where l ∉ E is a distinguished element of M. The l-port of M is the s...
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We sh...
Let M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
A hypergraph is called box-Mengerian if the linear system Ax ≥ 1, x ≥ 0 is box-totally dual integral...
Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
AbstractWe prove that each (rational) polyhedron of full dimension is determined by a unique minimal...
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. ...