Combinatorial Optimization
From MaRDI portal
Publication:2716048
DOI10.1137/1.9780898717105zbMath0972.90059OpenAlexW1597962932MaRDI QIDQ2716048
Publication date: 30 May 2001
Full work available at URL: https://doi.org/10.1137/1.9780898717105
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial aspects of packing and covering (05B40)
Related Items
Clean Clutters and Dyadic Fractional Packings, On Packing Dijoins in Digraphs and Weighted Digraphs, Relation between broadcast domination and multipacking numbers on chordal graphs, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, Initial ideals of unimodular integer programs, Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs, Opposite Elements in Clutters, Unnamed Item, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, Unnamed Item, Asymptotic resurgence via integral closures, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices, Broadcast domination and multipacking: bounds and the integrality gap, The positive circuits of oriented matroids with the packing property or idealness, The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems, Consequences of the packing problem, The facets and the symmetries of the approval-voting polytope, Idealness of k-wise Intersecting Families, On Dyadic Fractional Packings of $T$-Joins, A polyhedral view to a generalization of multiple domination, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, Combinatorics of Cremona monomial maps, Random monomial ideals, A survey on flows in graphs and matroids, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, Delta Minors, Delta Free Clutters, and Entanglement, ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES, The hybrid electric vehicle-traveling salesman problem, Even poset and a parity result for binary linear code, Total dual dyadicness and dyadic generating sets, Embedded associated primes of powers of square-free monomial ideals, Shattering inequalities for learning optimal decision trees, Clean tangled clutters, simplices, and projective geometries, Binary signed-graphic matroids: representations and recognition algorithms, A new infinite family of minimally nonideal matrices, Packing arborescences in random digraphs, Sparse recovery with integrality constraints, Packing six \(T\)-joins in plane graphs, Total Dual Integrality of Triangle Covering, Packing odd circuits in Eulerian graphs, On the behavior of the \(N_{+}\)-operator under blocker duality, Packing cycles exactly in polynomial time, On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity, A tight lower bound for the hardness of clutters, Alternatives for testing total dual integrality, Fractional packing in ideal clutters, Balanced matrices, The Steiner connectivity problem, An approach to solving \(A^{k}=J-I\), Non total-unimodularity neutralized simplicial complexes, The max-flow min-cut property and \(\pm 1\)-resistant sets, Square-free perfect graphs., Rees cones and monomial rings of matroids, Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs, On asteroidal sets in chordal graphs, The maximum vertex coverage problem on bipartite graphs, The complexity of recognizing linear systems with certain integrality properties, Packing Arborescences in Random Digraphs, On total \(f\)-domination: polyhedral and algorithmic results, On circulant thin Lehman matrices, Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems, The Multilinear Polytope for Acyclic Hypergraphs, A new approach for modeling and solving set packing problems, Shellable graphs and sequentially Cohen-Macaulay bipartite graphs, Solution of three problems of Cornuéjols, Enumeration of 2-level polytopes, Cuboids, a class of clutters, Relative blocking in posets, Blocking optimal arborescences, Pfaffian graphs, \(T\)-joins and crossing numbers, Progress on the description of identifying code polyhedra for some families of split graphs, Route relaxations on GPU for vehicle routing problems, Polyhedra associated with identifying codes in graphs, The max-flow min-cut property of two-dimensional affine convex geometries, One-overlapped factorizations of non-abelian groups, Depth and regularity of monomial ideals via polarization and combinatorial optimization, Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type, Some insight into characterizations of minimally nonideal matrices, Ideal clutters, A polyhedral approach to the stability of a family of coalitions, Unnamed Item, Clutter nonidealness, Balanced Cayley graphs and balanced planar graphs, Recognizing Helly edge-path-tree graphs and their clique graphs, The nonidealness index of rank-ideal matrices, On packing and covering polyhedra of consecutive ones circulant clutters, Perfectness of clustered graphs, Idealness and 2-resistant sets, Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems, On the set covering polyhedron of circulant matrices, Broadcast Domination in Graphs, A SAT Approach to Branchwidth, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Implosive graphs: Square-free monomials on symbolic Rees algebras, Pitch, extension complexity, and covering problems, The star dichromatic number, Lehman matrices, Resistant Sets in the Unit Hypercube, A superclass of edge-path-tree graphs with few cliques, Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals, Structure of cubic Lehman matrices, Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality, The strong perfect graph conjecture: 40 years of attempts, and its resolution, The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields, Colouring non-even digraphs, A characterization of weakly bipartite graphs, On balanced graphs, Normality criteria for monomial ideals, Tight Cycle Relaxations for the Cut Polytope, A duality theorem for the ic-resurgence of edge ideals, Linear Balanceable and Subcubic Balanceable Graphs*, On partial descriptions of König graphs for odd paths and all their spanning supergraphs, Idealness of \(k\)-wise intersecting families
