scientific article; zbMATH DE number 3580570

zbMATH Open0373.05040MaRDI QIDQ4149476FDOQ4149476

Authors: Jack Edmonds, Rick Giles 

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (only showing first 100 items - show all)

• Some sequences associated with combinatorial structures
• \(M\)-convex functions and tree metrics
• The value function of an integer program
• Characterizing and recognizing generalized polymatroids
• On total dual integrality
• Extended cuts
• Structural theorems for submodular functions, polymatroids and polymatroid intersections
• Perfect, ideal and balanced matrices
• Non-standard approaches to integer programming
• Tree-representation of set families and applications to combinatorial decompositions
• A Representation Theorem for Union-Difference Families and Application
• A note on Frank's generalized polymatroids
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• Dijkstra's algorithm and L-concave function maximization
• Total dual integrality and integer polyhedra
• The nucleon of cooperative games and an algorithm for matching games
• On a composition of independence systems by circuit identification
• Packing cycles exactly in polynomial time
• Minimizing a sum of submodular functions
• On some algorithmic aspects of hypergraphic matroids
• Total dual integrality implies local strong unimodularity
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• A flow model based on polylinking system
• Clique partitioning of interval graphs with submodular costs on the cliques
• On the core of network synthesis games
• An application of submodular flows
• The ellipsoid method and its consequences in combinatorial optimization
• Directed submodularity, ditroids and directed submodular flows
• The \(b\)-branching problem in digraphs
• Randomized algorithms for finding the shortest negative cost cycle in networks
• A fast cost scaling algorithm for submodular flow
• On switching paths polyhedra
• Duality for balanced submodular flows
• Polymatroidal flows with lower bounds
• Polyhedral structure of submodular and posi-modular systems
• Path-closed sets
• An algorithm for minimum cost arc-connectivity orientations
• On totally dual integral systems
• Ideal clutters
• Canonical decompositions of symmetric submodular systems
• Finding feasible vectors of Edmonds-Giles polyhedra
• Linear and combinatorial sharing problems
• The complexity of recognizing linear systems with certain integrality properties
• Operations that preserve total dual integrality
• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
• A counterexample to a conjecture of Edmonds and Giles
• A strongly polynomial minimum cost circulation algorithm
• An out-of-kilter method for submodular flows
• An application of simultaneous diophantine approximation in combinatorial optimization
• Generalized polymatroids and submodular flows
• A note on polylinking flow networks
• Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
• Balanced matrices
• Minimization on submodular flows
• A dual algorithm for submodular flow problems
• Negative circuits for flows and submodular flows
• Polyhedra related to undirected multicommodity flows
• A survey of the algorithmic aspects of modular decomposition
• Polyhedral proof methods in combinatorial optimization
• A capacity scaling algorithm for convex cost submodular flows
• The maximum vertex coverage problem on bipartite graphs
• A polyhedral study of lifted multicuts
• Using separation algorithms to generate mixed integer model reformulations
• Matchings and covers in hypergraphs
• Rooted \(k\)-connections in digraphs
• An integer analogue of Carathéodory's theorem
• Packing cycles in graphs
• Directed cut transversal packing for source-sink connected graphs
• A Survey on Covering Supermodular Functions
• On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
• Inverse problems of submodular functions on digraphs
• Minmax relations for cyclically ordered digraphs
• Unifying the representation of symmetric crossing families and weakly partitive families
• Testing membership in matroid polyhedra
• How to tidy up a symmetric set-system by use of uncrossing operations
• Proving total dual integrality with cross-free families—A general framework
• Color constrained combinatorial optimization problems
• A weighted min-max relation for intervals
• Title not available (Why is that?)
• Recent trends in combinatorial optimization
• Degree bounded matroids and submodular flows
• Cores of games with restricted cooperation
• Structures of polyhedra determined by submodular functions on crossing families
• Cuboids, a class of clutters
• A cost-scaling algorithm for \(0-1\) submodular flows
• Greedoid polyhedra
• On box totally dual integral polyhedra
• Tree-compositions and orientations
• On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
• Complexity of packing common bases in matroids
• A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
• Recent results on well-balanced orientations
• Computing weighted strength and applications to partitioning
• Convexity of graph-restricted games induced by minimum partitions
• Ranking tournaments with no errors. II: Minimax relation
• Submodular function minimization and polarity
• On the Galois lattice of bipartite distance hereditary graphs
• A primal dual integer programming algorithm
• The max-flow min-cut property and \(\pm 1\)-resistant sets
• A discrete convex min-max formula for box-TDI polyhedra

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149476)