9 research outputs found

    A generalization of totally unimodular and network matrices.

    Get PDF
    In this thesis we discuss possible generalizations of totally unimodular and network matrices. Our purpose is to introduce new classes of matrices that preserve the advantageous properties of these well-known matrices. In particular, our focus is on the polyhedral consequences of totally unimodular matrices, namely we look for matrices that can ensure vertices that are scalable to an integral vector by an integer k. We argue that simply generalizing the determinantal structure of totally unimodular matrices does not suffice to achieve this goal and one has to extend the range of values the inverses of submatrices can contain. To this end, we define k-regular matrices. We show that k-regularity is a proper generalization of total unimodularity in polyhedral terms, as it guarantees the scalability of vertices. Moreover, we prove that the k-regularity of a matrix is necessary and sufficient for substituting mod-k cuts for rank-1 Chvatal-Gomory cuts. In the second part of the thesis we introduce binet matrices, an extension of network matrices to bidirected graphs. We provide an algorithm to calculate the columns of a binet matrix using the underlying graphical structure. Using this method, we prove some results about binet matrices and demonstrate that several interesting classes of matrices are binet. We show that binet matrices are 2-regular, therefore they provide half-integral vertices for a polyhedron with a binet constraint matrix and integral right hand side vector. We also prove that optimization on such a polyhedron can be carried out very efficiently, as there exists an extension of the network simplex method for binet matrices. Furthermore, the integer optimization with binet matrices is equivalent to solving a matching problem. We also describe the connection of k-regular and binet matrices to other parts of combinatorial optimization, notably to matroid theory and regular vectorspaces

    An Algorithmic Theory of Integer Programming

    Full text link
    We study the general integer programming problem where the number of variables nn is a variable part of the input. We consider two natural parameters of the constraint matrix AA: its numeric measure aa and its sparsity measure dd. We show that integer programming can be solved in time g(a,d)poly(n,L)g(a,d)\textrm{poly}(n,L), where gg is some computable function of the parameters aa and dd, and LL is the binary encoding length of the input. In particular, integer programming is fixed-parameter tractable parameterized by aa and dd, and is solvable in polynomial time for every fixed aa and dd. Our results also extend to nonlinear separable convex objective functions. Moreover, for linear objectives, we derive a strongly-polynomial algorithm, that is, with running time g(a,d)poly(n)g(a,d)\textrm{poly}(n), independent of the rest of the input data. We obtain these results by developing an algorithmic framework based on the idea of iterative augmentation: starting from an initial feasible solution, we show how to quickly find augmenting steps which rapidly converge to an optimum. A central notion in this framework is the Graver basis of the matrix AA, which constitutes a set of fundamental augmenting steps. The iterative augmentation idea is then enhanced via the use of other techniques such as new and improved bounds on the Graver basis, rapid solution of integer programs with bounded variables, proximity theorems and a new proximity-scaling algorithm, the notion of a reduced objective function, and others. As a consequence of our work, we advance the state of the art of solving block-structured integer programs. In particular, we develop near-linear time algorithms for nn-fold, tree-fold, and 22-stage stochastic integer programs. We also discuss some of the many applications of these classes.Comment: Revision 2: - strengthened dual treedepth lower bound - simplified proximity-scaling algorith

    On matrices with the Edmonds-Johnson property arising from bidirected graphs

    Get PDF
    In this paper we study totally half-modular matrices obtained from {0,±1}-matrices with at most two nonzero entries per column by multiplying by 2 some of the columns. We give an excluded-minor characterization of the matrices in this class having strong Chv`atal rank 1. Our result is a special case of a conjecture by Gerards and Schrijver [11]. It also extends a well known theorem of Edmonds and Johnson [10]

    Structural and decomposition results for binet matrices, bidirected graphs and signed-graphic matroids.

    Get PDF
    In this thesis we deal with binet matrices and the class of signed-graphic matroids which is the class of matroids represented over R by binet matrices. The thesis is divided in three parts. In the first part, we provide the vast majority of the notions used throughout the thesis and some results regarding the class of binet matrices. In this part, we focus on the class of linear and integer programming problems in which the constraint matrix is binet and provide methods and algorithms which solve these problems efficiently. The main new result is that the existing combinatorial methods can not solve the {lcub}0, 1/2{rcub}-separation problem (special case of the well known separation problem) with integral binet matrices. The main new results of the whole thesis are provided in the next two parts. In the second part, we present a polynomial time algorithm to construct a bidirected graph for any totally unimodular matrix B by finding node-edge incidence matrices Q and S such that QB = S. Seymour's famous decomposition theorem for regular matroids states that any totally unimodular matrix can be constructed through a series of composition operations called k-sums starting from network matrices and their transposes and two compact representation matrices B1 and B2 of a certain ten element matroid. Given that B1 and B2 are binet matrices, we examine the k-sums of network and binet matrices (k = 1,2, 3). It is shown that the k-sum of a network and a binet matrix is a binet matrix, but binet matrices are not closed under this operation for k = 2, 3. A new class of matrices is introduced, the so-called tour matrices, which generalises network and totally unimodular matrices. For any such matrix there exists a bidirected graph such that the columns represent a collection of closed tours in the graph. It is shown that tour matrices are closed under 1-, 2- and 3-sum as well as under elementary operations on their rows and columns. Given the constructive proofs of the above results regarding the k-sum operations and existing recognition algorithms for network and binet matrices, an algorithm is presented which constructs a bidirected graph for any totally unimodular matrix. In the third part of this thesis we deal with the frame matroid of a signed graph, or simply the signed-graphic matroid. Several new results are provided in this last part of the thesis. Specifically, given a signed graph, we provide methods to find representation matrices of the associated signed-graphic matroid over GF(2), GF(3) and R. Furthermore, two new matroid recognition algorithms are presented in this last part. The first one determines whether a binary matroid is signed-graphic or not and the second one determines whether a (general) matroid is binary signed-graphic or not. Finally, one of the most important new results of this thesis is the decomposition theory for the class of binary signed-graphic matroids which is provided in the last chapter. In order to achieve this result, we employed Tutte's theory of bridges. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on k-sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minors resulting from the deletion of a cocircuit of a binary matroid will be graphic matroids except for one that will be signed-graphic if and only if the matroid is signed-graphic. The decomposition theory for binary signed-graphic matroids is a joint work with G. Appa and L. Pitsoulis

    Decomposition-based methods for Connectivity Augmentation Problems

    Get PDF
    In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems. In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional set of edges L⊆V×VL \subseteq V\times V that we refer to as links. The task is to find a minimum cost subset of links F⊆LF \subseteq L such that adding F to G makes the graph (k+1)-edge-connected. We first study a special case when k=1, which is equivalent to the Tree Augmentation problem. We present a breakthrough result by Adjiashvili that gives an approximation algorithm for Tree Augmentation with approximation guarantee below 2, under the assumption that the cost of every link ℓ∈L\ell \in L is bounded by a constant. The algorithm is based on an elegant decomposition based method and uses a novel linear programming relaxation called the γ\gamma -bundle LP. We then present a subsequent result by Fiorini, Gross, Konemann and Sanita who give a 3/2+ϵ3/2+\epsilon approximation algorithm for the same problem. This result uses what are known as Chvatal-Gomory cuts to strengthen the linear programming relaxation used by Adjiashvili, and uses results from the theory of binet matrices to give an improved algorithm that is able to attain a significantly better approximation ratio. Next, we look at the special case when k=2. This case is equivalent to what is known as the Cactus Augmentation problem. A recent result by Cecchetto, Traub and Zenklusen give a 1.393-approximation algorithm for this problem using the same decomposition based algorithmic framework given by Adjiashvili. We present a slightly weaker result that uses the same ideas and obtains a 3/2+ϵ3/2+\epsilon approximation ratio for the Cactus Augmentation problem. Next, we take a look at the integrality ratio of the natural linear programming relaxation for Tree Augmentation, and present a result by Nutov that bounds this integrality gap by 28/15. Finally, we study the related Forest Augmentation problem that is a generalization of Tree Augmentation. There is no approximation algorithm for Forest Augmentation known that obtains an approximation ratio below 2. We show that we can obtain a 29/15-approximation algorithm for Forest Augmentation under the assumption that the LP solution is half-integral via a reduction to Tree Augmentation. We also study the structure of extreme points of the natural linear programming relaxation for Forest Augmentation and prove several properties that these extreme points satisfy

    Optimization with binet matrices

    Get PDF
    This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Binet matrices are pivoted versions of the node-edge incidence matrices of bidirected graphs. It is shown that efficient methods are available to solve such optimization problems. Linear programs can be solved with the generalized network simplex method, while integer programs are converted to a matching problem. It is also proved that an integral binet matrix has strong Chvátal rank 1. An example of binet matrices, namely matrices with at most three non-zeros per row, is given

    Optimization with binet matrices

    No full text
    This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Linear programs can be solved with the generalized network simplex method, while integer programs are converted to a matching problem. It is also proved that an integral binet matrix has strong Chvátal rank 1

    Review of "Optimization with binet matrices"

    No full text

    A Generalization of Totally Unimodular and Network Matrices

    No full text
    In this thesis we discuss possible generalizations of totally unimodular and network matrices. Our purpose is to introduce new classes of matrices that preserve the advantageous properties of these well-known matrices. In particular, our focus is on the polyhedral consequences of totally unimodular matrices, namely we look for matrices that can ensure vertices that are scalable to an integral vector by an integer k. We argue that simply generalizing the determinantal structure of totally unimodular matrices does not suffice to achieve this goal and one has to extend the range of values the inverses of submatrices can contain. To this end, we define k-regular matrices. We show that k-regularity is a proper generalization of total unimodularity in polyhedral terms, as it guarantees the scalability of vertices. Moreover, we prove that the k-regularity of a matrix is necessary and sufficient for substituting mod-k cuts for rank-1 Chvatal-Gomory cuts. In the second part of the thesis we introduce binet matrices, an extension of network matrices to bidirected graphs. We provide an algorithm to calculate the columns of a binet matrix using the underlying graphical structure. Using this method, we prove some results about binet matrices and demonstrate that several interesting classes of matrices are binet. We show that binet matrices are 2-regular, therefore they provide half-integral vertices for a polyhedron with a binet constraint matrix and integral right hand side vector. We also prove that optimization on such a polyhedron can be carried out very efficiently, as there exists an extension of the network simplex method for binet matrices. Furthermore, the integer optimization with binet matrices is equivalent to solving a matching problem. We also describe the connection o..
    corecore