Generalized polymatroids and submodular flows

Mathematical Programming

Volumn 42, Issue 1-3, 1988, Pages 489-563

  Frank, András ^a   Tardos, Éva ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL PROGRAMMING;

COMBINATORIAL OPTIMIZATION; GENERALIZED POLYMATROIDS; GREEDY ALGORITHM; POLYHEDRAL STRUCTURES; SUBMODULAR FLOWS;

OPTIMIZATION;

EID: 34250090935     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01589418     Document Type: Article

References (86)

1. The perfectly matchable subgraph polytope of bipartite graphs
2. The partial order of a polymatroid extreme point
3. “O jistém problému minimálnim“ (with extended abstract in German)
4. Arc-disjoint arborescences of diagraphs
5. On box totally dual integral polyhedra
6. An unbounded matroid intersection polyhedron
7. Optimal attack and reinforcement of a network
8. On submodular function minimization
9. A primal-dual algorithm for submodular flows
10. Matroids and submodular functions
11. Minimum partition of a matroid into independent sets
12. Lehman's switching game and a theorem of Tutte and Nash-Williams
13. Submodular functions, matroids, and certain polyhedra
14. Matroids and the greedy algorithm
15. Edge-disjoint branchings
16. Matroid intersection
17. A min-max relation for submodular functions on graphs
18. On the number of common bases of two matroids
19. Kernel systems of directed graphs
20. On the orientation of graphs
21. How to make a digraph strongly connected
22. On disjoint trees and arborescences
23. A weighted matroid intersection algorithm
24. An algorithm for submodular functions on graphs
25. Finding feasible vectors of Edmonds-Giles polyhedra
26. Submodular flows
27. Generalized polymatroids
28. How to orient the edges of a graph
29. Matroids from crossing families
30. An algorithm for the unbounded matroid intersection polyhedron
31. Covering directed and odd cuts
32. Algorithms for solving the independent flow problems
33. Structures of polyhedra determined by submodular functions on crossing families
34. A note on Frank's generalized polymatroids
35. A characterization of faces of the base polyhedron associated with a submodular system
36. Submodular systems and related topics
37. A note on submodular functions on distributive lattices
38. Optimal assignments in an ordered set: An application of matroid theory
39. On matroid intersections
40. Connected and alternating vectors, polyhedra and algorithms
41. The ellipsoid method and its consequences in combinatorial optimization
42. Minimum cost flow with set-constraints
43. Strong maps of geometries
44. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
45. A generalization of max-flow-min-cut
46. Ordered sets and linear programming
47. Network-flow algorithms for lower truncated transversal polymatroids
48. Matroid intersection algorithms
49. A generalization of König's theorem
50. Flats in matroids and geometric graphs
51. Submodular functions and convexity
52. On generic rigidity in the plane
53. Arc-disjoint arborescences of digraphs
54. Independence structures and submodular functions
55. Rado's theorem for polymatroids
56. Blocking, anti-blocking, and pairs of matroids and polymatroids
57. An application of matroids to graph theory
58. Well-balanced orientation of finite graphs and unobtrusive odd-vertex pairing
59. A theorem on independence functions
60. Note on independence functions
61. Cores of convex games
62. On total dual integrality
63. Packing and covering of crossing families of cuts
64. Total dual integrality from directed graphs, crossing families and sub- and supermodular functions
65. Proving total dual integrality with cross-free families—a general framework
66. Supermodular colourings
67. Generalized matroids and supermodular colourings
68. Layered augmenting path algorithms
69. Adjacency on polymatroids
70. On the problem of decomposing a graph into n connected factors
71. Covering the edge set of a directed graph with trees
72. A minimax equality related to the longest directed path in an acyclic graph
73. Kruskal's theorem for matroids
74. Minimization on submodular flows