scientific article; zbMATH DE number 3422402
From MaRDI portal
Publication:5684698
zbMath0268.05019MaRDI QIDQ5684698
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Linear programming (90C05) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Graph theory (05Cxx) Designs and configurations (05Bxx)
Related Items (only showing first 100 items - show all)
Compatible systems of representatives ⋮ Universal Tutte characters via combinatorial coalgebras ⋮ Extreme convex set functions with many nonnegative differences ⋮ Matroid optimisation problems with nested non-linear monomials in the objective function ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Branch-and-price approaches for the network design problem with relays ⋮ Minimum cuts in parametric networks ⋮ On games corresponding to sequencing situations with ready times ⋮ Equilibrium in a market of intellectual goods ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ A short proof of optimality of the bottom up algorithm for discrete resource allocation problems ⋮ Submodular linear programs on forests ⋮ Matrix orbit closures ⋮ Cores and Weber sets for fuzzy extensions of cooperative games ⋮ Minimum cut problem using bases of extended polymatroids ⋮ On rank-critical matrix spaces ⋮ Syzygies on Tutte polynomials of freedom matroids ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ The connected facility location polytope ⋮ Fair representation in dimatroids ⋮ On the graphic matroid parity problem ⋮ Improved bound for the Carathéodory rank of the bases of a matroid ⋮ The linear delta-matroid parity problem ⋮ Hamiltonian double Latin squares ⋮ Tropical cycles and Chow polytopes ⋮ A push-relabel framework for submodular function minimization and applications to parametric optimization ⋮ On decomposing a hypergraph into \(k\) connected sub-hypergraphs ⋮ Combined connectivity augmentation and orientation problems ⋮ Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability ⋮ A greedy algorithm for convex geometries ⋮ New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. ⋮ Improving graph partitions using submodular functions. ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ A greedy algorithm for some classes of integer programs. ⋮ Polyhedra and parameter spaces for matroids over valuation rings ⋮ Valuative invariants for polymatroids ⋮ Structural aspects of ordered polymatroids ⋮ Point-hyperplane frameworks, slider joints, and rigidity preserving transformations ⋮ On stable set polyhedra for K//(1,3)free graphs ⋮ A greedy algorithm for solving ordinary transportation problem with capacity constraints ⋮ Application of M-convex submodular flow problem to mathematical economics ⋮ A constrained independent set problem for matroids ⋮ Multi-splits and tropical linear spaces from nested matroids ⋮ Using separation algorithms to generate mixed integer model reformulations ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ \(b\)-matching degree-sequence polyhedra ⋮ Rigid cylindrical frameworks with two coincident points ⋮ On the \(k\)-cut problem ⋮ Euclidean semi-matchings of random samples ⋮ Extremality of submodular functions ⋮ Crashing a maximum-weight complementary basis ⋮ Paths on polymatroids ⋮ Structural properties of matroid matchings ⋮ Dilworth truncations and \(k\)-induced matroids ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Separating from the dominant of the spanning tree polytope ⋮ Invertibility of the base Radon transform of a matroid ⋮ Discrete convexity and unimodularity. I. ⋮ \(M\)-convex functions and tree metrics ⋮ Extreme convex set functions with finite carrier: General theory ⋮ A good algorithm for edge-disjoint branching ⋮ Coordinatewise domain scaling algorithm for M-convex function minimization ⋮ Random matroids ⋮ The Euler circuit theorem for binary matroids ⋮ On the ratio of optimal integral and fractional covers ⋮ A short convex-hull proof for the all-different system with the inclusion property ⋮ The matroids with the max-flow min-cut property ⋮ Bimatroids and invariants ⋮ Structure of a simple scheduling polyhedron ⋮ Fractional matroid matchings ⋮ Eigensets and power products of a bimatroid ⋮ Matroids on partially ordered sets ⋮ The optimal path-matching problem ⋮ Power control and capacity of spread spectrum wireless networks ⋮ On the concavity of delivery games ⋮ Greedy sets and related problems ⋮ Some recent results in combinatorial approaches to dynamical systems ⋮ On totally dual integral systems ⋮ Solving combinatorial problems with combined min-max-min-sum objective and applications ⋮ The ellipsoid method and its implications ⋮ Fenchel-type duality for matroid valuations ⋮ The nucleon of cooperative games and an algorithm for matching games ⋮ Discrete convex analysis ⋮ The English auction with differentiated commodities ⋮ Extension of M-convexity and L-convexity to polyhedral convex functions ⋮ A necessary and sufficient condition for the convexity in oligopoly games ⋮ Polyhedral structure of submodular and posi-modular systems ⋮ Independent branchings in acyclic digraphs ⋮ Finding all common bases in two matroids ⋮ A combinatorial algorithm minimizing submodular functions in strongly polynomial time. ⋮ A fully combinatorial algorithm for submodular function minimization. ⋮ The computational complexity of some problems of linear algebra ⋮ On fuzzification of matroids ⋮ Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness ⋮ Discrete polymatroids ⋮ A note on optimal covering augmentation for graphic polymatroids. ⋮ Some recent results in the analysis of greedy algorithms for assignment problems ⋮ A faster algorithm for computing the strength of a network ⋮ Minimum cost source location problem with vertex-connectivity requirements in digraphs ⋮ The Steiner tree polytope and related polyhedra
This page was built for publication:
