scientific article; zbMATH DE number 3580570
From MaRDI portal
zbMath0373.05040MaRDI QIDQ4149476
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items
Extended cuts, A strongly polynomial minimum cost circulation algorithm, Linear and combinatorial sharing problems, Polyhedral proof methods in combinatorial optimization, On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem, Minimum cost multiflows in undirected networks, A fast cost scaling algorithm for submodular flow, An out-of-kilter method for submodular flows, Greedoid polyhedra, How to tidy up a symmetric set-system by use of uncrossing operations, An algorithm for minimum cost arc-connectivity orientations, An application of simultaneous diophantine approximation in combinatorial optimization, Directed cut transversal packing for source-sink connected graphs, A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\), A capacity scaling algorithm for convex cost submodular flows, Optimum partitioning into intersections of ring families, Generalized polymatroids and submodular flows, Directed submodularity, ditroids and directed submodular flows, An application of submodular flows, Polyhedra related to undirected multicommodity flows, Total dual integrality and integer polyhedra, Submodular linear programs on forests, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Minmax relations for cyclically ordered digraphs, Characterizing and recognizing generalized polymatroids, Tree-representation of set families and applications to combinatorial decompositions, Randomized algorithms for finding the shortest negative cost cycle in networks, A counterexample to a conjecture of Edmonds and Giles, Packing cycles in graphs, Packing cycles exactly in polynomial time, Discrete extremal problems, On total dual integrality, A survey of the algorithmic aspects of modular decomposition, Minimization on submodular flows, Total dual integrality and b-matchings, The ellipsoid method and its consequences in combinatorial optimization, Cutting planes from a mixed integer Farkas lemma., Graph covers using \(t\)-colourable vertex sets., The complexity of recognizing linear systems with certain integrality properties, Total dual integrality of the linear complementarity problem, Using separation algorithms to generate mixed integer model reformulations, Color constrained combinatorial optimization problems, Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem, A dual algorithm for submodular flow problems, A weighted min-max relation for intervals, On a composition of independence systems by circuit identification, A cost-scaling algorithm for \(0-1\) submodular flows, Negative circuits for flows and submodular flows, Coflow polyhedra, Greedy oriented flows, Inheritance of convexity for partition restricted games, Recent results on well-balanced orientations, Lattice matrices, intersection of ring families and dicuts, Non-standard approaches to integer programming, Ideal clutters, \(M\)-convex functions and tree metrics, Coordinatewise domain scaling algorithm for M-convex function minimization, Minimizing a sum of submodular functions, A capacity scaling algorithm for M-convex submodular flow, A flow model based on polylinking system, On switching paths polyhedra, Duality for balanced submodular flows, Polymatroidal flows with lower bounds, Total dual integrality and integral solutions of the linear complementarity problem, The box-TDI system associated with 2-edge connected spanning subgraphs, Gainfree Leontief substitution flow problems, Solution of two fractional packing problems of Lovász, Packing circuits in matroids, Matchings and covers in hypergraphs, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Integral infeasibility and testing total dual integrality, On the core of network synthesis games, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Note on inverse problem with \(l_\infty\) objective function, Rooted \(k\)-connections in digraphs, Canonical decompositions of symmetric submodular systems, A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors, A decomposition of the matroids with the max-flow min-cut property, On totally dual integral systems, Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2, Inverse problems of submodular functions on digraphs, The nucleon of cooperative games and an algorithm for matching games, Operations that preserve total dual integrality, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Polyhedral structure of submodular and posi-modular systems, Recent trends in combinatorial optimization, Short proofs on the matching polyhedron, Packing and covering of crossing families of cuts, A note on Frank's generalized polymatroids, Testing membership in matroid polyhedra, Finding feasible vectors of Edmonds-Giles polyhedra, A family of perfect graphs associated with directed graphs, Total weak unimodularity: Testing and applications, A primal dual integer programming algorithm, A note on matchings and separability, Path-closed sets, Some sequences associated with combinatorial structures, An integer analogue of Carathéodory's theorem, Totally tight Chvatal-Gomory cuts, Idealness of k-wise Intersecting Families, Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, On box totally dual integral polyhedra, Separation of partition inequalities with terminals, A Polyhedral Description of Kernels, Finding popular branchings in vertex-weighted digraphs, A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm, Computing Weighted Strength and Applications to Partitioning, Total dual dyadicness and dyadic generating sets, Fair integral submodular flows, Intersecting restrictions in clutters, A Discrete Convex Min-Max Formula for Box-TDI Polyhedra, Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Simple push-relabel algorithms for matroids and submodular flows, Lattice polyhedra and submodular flows, On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, Min-cost multiflows in node-capacitated undirected networks, Theorems of the alternative for conic integer programming, Trader multiflow and box-TDI systems in series-parallel graphs, An algorithmic approach to dual integrality of matching and extensions, On Packing Dijoins in Digraphs and Weighted Digraphs, The b‐bibranching problem: TDI system, packing, and discrete convexity, Recent progress on integrally convex functions, Complexity of (arc)-connectivity problems involving arc-reversals or deorientations, Making a tournament k $k$‐strong, The \(b\)-branching problem in digraphs, A Unified Framework for Pricing in Nonconvex Resource Allocation Games, Total dual integrality implies local strong unimodularity, Total Dual Integrality of Triangle Covering, A note on polylinking flow networks, Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, A polyhedral study of lifted multicuts, Box-total dual integrality and edge-connectivity, Unnamed Item, Finding popular branchings in vertex-weighted directed graphs, Balanced matrices, Affine and projective tree metric theorems, A Survey on Covering Supermodular Functions, The max-flow min-cut property and \(\pm 1\)-resistant sets, The maximum vertex coverage problem on bipartite graphs, Degree bounded matroids and submodular flows, Tree-compositions and orientations, Clique partitioning of interval graphs with submodular costs on the cliques, Computation and efficiency of potential function minimizers of combinatorial congestion games, Optimal Matching Forests and Valuated Delta-Matroids, Cuboids, a class of clutters, Ranking tournaments with no errors. II: Minimax relation, Proving total dual integrality with cross-free families—A general framework, Dijkstra's algorithm and L-concave function maximization, Abstract flows over time: a first step towards solving dynamic packing problems, Structures of polyhedra determined by submodular functions on crossing families, Perfect, ideal and balanced matrices, Solution of two fractional packing problems of Lovász. (Reprint), A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows, Max-multiflow/min-multicut for G+H series-parallel, A new infinite class of ideal minimally non-packing clutters, Superadditive characterizations of pure integer programming feasibility, Complexity of packing common bases in matroids, A Representation Theorem for Union-Difference Families and Application, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, An exact algorithm for robust influence maximization, The Minimum Weight In-Tree Cover Problem, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Connected and alternating vectors: Polyhedra and algorithms, When Is the Matching Polytope Box-Totally Dual Integral?, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Multicommodity flows and cuts in polymatroidal networks, The Schrijver system of the flow cone in series-parallel graphs, Polyhedra related to a lattice, Dominants and submissives of matching polyhedra, Cores of games with restricted cooperation, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Convexity of graph-restricted games induced by minimum partitions, Finite checkability for integer rounding properties in combinatorial programming problems, Unifying the representation of symmetric crossing families and weakly partitive families, Integer plane multiflow maximisation: one-quarter-approximation and gaps, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, Submodular function minimization and polarity, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, The value function of an integer program, On some algorithmic aspects of hypergraphic matroids, On the Galois lattice of bipartite distance hereditary graphs, Idealness of \(k\)-wise intersecting families
