scientific article; zbMATH DE number 3422402
From MaRDI portal
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
Semiantichains and Unichain Coverings in Direct Products of Partial Orders, A decomposition property of polyhedra, Unnamed Item, The bipermutahedron, On box totally dual integral polyhedra, A 3/2-Approximation for the Metric Many-Visits Path TSP, Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Rigidity of Frameworks on Expanding Spheres, Tropical Computations in polymake, Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations, The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions, Submodular Functions: Learnability, Structure, and Optimization, Optimal priorities in GI|Gn|1 queue, Semimodular Functions and Combinatorial Geometries, A Discrete Convex Min-Max Formula for Box-TDI Polyhedra, Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification, Finding a Stable Allocation in Polymatroid Intersection, On the expansion of combinatorial polytopes, Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity, Hopf Monoids and Generalized Permutahedra, Greedoids from flames, Stellahedral geometry of matroids, The b‐bibranching problem: TDI system, packing, and discrete convexity, A generalization of the space of complete quadrics, Computational comparisons of different formulations for the Stackelberg minimum spanning tree game, On the polymatroid Tutte polynomial, The Polyhedral Geometry of Pivot Rules and Monotone Paths, Coincident-point rigidity in normed planes, A deterministic better-than-3/2 approximation algorithm for metric TSP, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs, Two algorithms for weighted matroid intersection, Choice functions, Tautological classes of matroids, Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints, Efficient Computation of Optimal Auctions via Reduced Forms, On Submodular Search and Machine Scheduling, The geometry of geometries: matroid theory, old and new, The divisor class group of a discrete polymatroid, Polypositroids, Celebrating Loday's associahedron, Beating the Integrality Ratio for $s$-$t$-Tours in Graphs, Unnamed Item, Matroid Intersection under Restricted Oracles, Deformation cones of hypergraphic polytopes, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, Core stability of the Shapley value for cooperative games, Polymatroids, closure operators and lattices, Simultaneous eating algorithm and greedy algorithm in assignment problems, Maximal matroids in weak order posets, Unnamed Item, Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\), Combinatorics and Hodge theory, Diverse collections in matroids and graphs, Blocking and anti-blocking pairs of polyhedra, A greedy algorithm for solving a certain class of linear programmes, The st-bond polytope on series-parallel graphs, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Faces for a linear inequality in 0–1 variables, Randomized mechanism design for decentralized network scheduling, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees, Matching Theory for Combinatorial Geometries, On the generalized minimum spanning tree problem, Approximating Incremental Combinatorial Optimization Problems, A submodular optimization problem with side constraints, Proving total dual integrality with cross-free families—A general framework, Fractional covers for forests and matchings, The core of games on ordered structures and graphs, Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions, On the subdifferential of a submodular function, Independent spanning trees with small depths in iterated line digraphs, Adjacency on polymatroids, A generalization of max flow—min cut, Structures of polyhedra determined by submodular functions on crossing families, A strongly polynomial time algorithm for a constrained submodular optimization problem, Unnamed Item, Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Minkowski summands of cubes, Geometric Rescaling Algorithms for Submodular Function Minimization, The Finite Matroid-Based Valuation Conjecture is False, The polytope algebra of generalized permutahedra, A Hierarchical Model for Cooperative Games, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Weakly Modular Graphs and Nonpositive Curvature, Connected and alternating vectors: Polyhedra and algorithms, Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation, A Tractable Class of Binary VCSPs via M-Convex Intersection, Unnamed Item, Unnamed Item, A Mixed-Integer Fractional Optimization Approach to Best Subset Selection, Integral decomposition in polyhedra, Polynomially Computable Bounds for the Probability of the Union of Events, Integer Rounding for Polymatroid and Branching Optimization Problems, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, Packing rooted directed cuts in a weighted directed graph, A characterisation of the generic rigidity of 2-dimensional point-line frameworks, Packing Steiner trees, Core-based criterion for extreme supermodular functions, Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique, Some combinatorial properties of discriminants in metric vector spaces, Sequencing unreliable jobs on parallel machines, Edge-disjoint rainbow spanning trees in complete graphs, Remarkable polyhedra related to set functions, games and capacities, Activity optimization games with complementarity, An out-of-kilter method for submodular flows, Greedoid polyhedra, A faster algorithm for computing the principal sequence of partitions of a graph, On submodular function minimization, Four proofs of Gittins' multiarmed bandit theorem, Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems, Looking for edge-equitable spanning trees, Linear spaces, transversal polymatroids and ASL domains, On matroids induced by packing subgraphs, Pseudomatroids, Extended formulations for independence polytopes of regular matroids, Embedding rectilinear Steiner trees with length restrictions, Antistrong digraphs, The popular matching and condensation problems under matroid constraints, Convexity of integer veto and elimination procedures, Generalized polymatroids and submodular flows, Optimization over the polyhedron determined by a submodular function on a co-intersecting family, Directed submodularity, ditroids and directed submodular flows, A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra, Minimum cost source location problem with local 3-vertex-connectivity requirements, A characterization of matroidal systems of inequalities, Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion, Total dual integrality and integer polyhedra, Combinatorial dynamical system theory: General framework and controllability criteria, Pre-emptive scheduling problems with controllable processing times, Matroids on convex geometries (cg-matroids), Axioms for infinite matroids, The greedy algorithm for partially ordered sets, Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, Matroid matching and some applications, Complexity of tropical Schur polynomials, Immersing complete digraphs, Discrete extremal problems, The root location problem for arc-disjoint arborescences, Super-modularity: Applications to convex games and to the greedy algorithm for LP, Matchings and \(\Delta\)-matroids, On matroid intersections, A convex representation of totally balanced games, The structure of crossing separations in matroids, Is submodularity testable?, On Minkowski sums of simplices, Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs, Stiefel tropical linear spaces, A novel probabilistic formulation for locating and sizing emergency medical service stations, A framework of discrete DC programming by discrete convex analysis, On cardinality constrained polymatroids, Co-2-plex vertex partitions, On finding optimal polytrees, Equivalence of permutation polytopes corresponding to strictly supermodular functions, Theta rank, levelness, and matroid minors, A cost-scaling algorithm for \(0-1\) submodular flows, George Dantzig's impact on the theory of computation, Note on pseudolattices, lattices and submodular linear programs, Bases-cobases graphs and polytopes of matroids, Poset matching---a distributive analog of independent matching, Submodular functions in graph theory, Independence-domination duality, Survivable networks, linear programming relaxations and the parsimonious property, The convex hull of two core capacitated network design problems, Dynamic linear programming games with risk-averse players, \(K\)-classes for matroids and equivariant localization, My experiences as a student and researcher in OR during the 1960's and 70's, Algebraic and topological closure conditions for classes of pseudo-Boolean functions, Randomized priority algorithms, Monge extensions of cooperation and communication structures, On set functions that can be extended to convex functionals, Minimizing a sum of submodular functions, Explicit bounds for graph minors, Eisenberg-Gale markets: algorithms and game-theoretic properties, A general model for matroids and the greedy algorithm, The \(S\)-digraph optimization problem and the greedy algorithm, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Rooted \(k\)-connections in digraphs, A vector exchange property of submodular systems, Maximization of submodular functions: theory and enumeration algorithms, Polyhedra with the integer Carathéodory property, Covering skew-supermodular functions by hypergraphs of minimum total size, On matroid parity and matching polytopes, Sparse hypergraphs and pebble game algorithms, A note on submodular set cover on matroids, Recent trends in combinatorial optimization, Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem, A note on Frank's generalized polymatroids, Decomposition of submodular functions, On the number of common bases of two matroids, Testing membership in matroid polyhedra, Finding feasible vectors of Edmonds-Giles polyhedra, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, A note on matchings and separability, An intersection theorem for supermatroids, 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, Matroids from hypersimplex splits, Submodularity and its application to some global constraints, The Paulsen problem made simple, Matroids are not Ehrhart positive, Universal Tutte polynomial, Matroid bases with cardinality constraints on the intersection, Dual greedy polyhedra, choice functions, and abstract convex geometries, An Improved Integrality Gap for Asymmetric TSP Paths, Standard complexes of matroids and lattice paths, A parameterized view to the robust recoverable base problem of matroids under structural uncertainty, Choquet-based optimisation in multiobjective shortest path and spanning tree problems, Resolution of ideals associated to subspace arrangements, Reachability in arborescence packings, Fair integral submodular flows, Gaussian downlink user selection subject to access limit, power budget, and rate demands, The facets of the spanning trees polytope, Discrete polymatroids satisfying a stronger symmetric exchange property, Chvátal-Gomory cuts for the Steiner tree problem, Cyclic flats of a polymatroid, On a Generalization of the Ryser-Brualdi-Stein Conjecture, Fair representation in the intersection of two matroids, Equivariant Chow classes of matrix orbit closures, Towards using the chordal graph polytope in learning decomposable models, Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes, On the combinatorial lower bound for the extension complexity of the spanning tree polytope, Packing of arborescences with matroid constraints via matroid intersection, A note on the implications of approximate submodularity in discrete optimization, A generalized-polymatroid approach to disjoint common independent sets in two matroids, Minkowski summands of cubes, Stochastic packing integer programs with few queries, The \(b\)-branching problem in digraphs, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, On the complexity of packing rainbow spanning trees, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, A strongly polynomial algorithm for line search in submodular polyhedra, Submodular optimization problems and greedy strategies: a survey, A ranking model for the greedy algorithm and discrete convexity, Cooperative games on simplicial complexes, Inequalities on submodular functions via term rewriting, Approximating the least core value and least core of cooperative games with supermodular costs, Tree-compositions and orientations, Solution concepts for games with general coalitional structure, The Hopf monoid and the basic invariant of directed graphs, Tropical flag varieties, A correct response model in knowledge structure theory, Algorithms for tight spans and tropical linear spaces, Elimination for generic sparse polynomial systems, Power of \(k\) choices and rainbow spanning trees in random graphs, Vertices of Schubitopes, An exchange theorem for bases of matroids, A greedy algorithm for maximizing a linear objective function, Polymatroid greedoids, Fuzzy bases of fuzzy independent set systems, Unnamed Item, Supermodular functions on finite lattices, A proof of Rado's theorem via principal extension, A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, Inverse problems and derivatives of determinants, Linear matroid intersection is in quasi-NC, Facets of the independent path-matching polytope, Optimal matroid partitioning problems, A note on interconnecting matchings in graphs, Complexity of packing common bases in matroids, Strong formulations for conic quadratic optimization with indicator variables, Reassembling Trees for the Traveling Salesman, Cooperative colorings of trees and of bipartite graphs, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, A primal-dual algorithm for the minimum partial set multi-cover problem, Spanning tree constrained determinantal point processes are hard to (approximately) evaluate, On the number of heterochromatic trees in nice and beautiful colorings of complete graphs, Matroid optimization problems with monotone monomials in the objective, An exact cutting plane method for \(k\)-submodular function maximization, Exact and approximation algorithms for weighted matroid intersection, A class of extreme convex set functions with finite carrier, Computing in combinatorial optimization, Deformation cones of graph associahedra and nestohedra, \(k\)-edge connected polyhedra on series-parallel graphs, Randomized selection algorithm for online stochastic unrelated machines scheduling, Submodular optimization views on the random assignment problem, On partitioning two matroids into common independent subsets, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, Parametric properties of the transportation problem and relations to supermatroids, Choice functions in the intersection of matroids, Submodular functions and rooted trees, Bisubmodular polyhedra, simplicial divisions, and discrete convexity, Orientations and detachments of graphs with prescribed degrees and connectivity, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, Submodular function minimization and polarity, A game theoretic approach to a problem in polymatroid maximization, On some algorithmic aspects of hypergraphic matroids, An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid, Network reinforcement, Flag matroids: algebra and geometry, A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications, A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\), Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, Generalized Wong sequences and their applications to Edmonds' problems
