Pages that link to "Item:Q1116889"
From MaRDI portal
The following pages link to Generalized polymatroids and submodular flows (Q1116889):
Displaying 50 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Characterizing and recognizing generalized polymatroids (Q403645) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Covering skew-supermodular functions by hypergraphs of minimum total size (Q1038104) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An application of submodular flows (Q1119596) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions (Q1184356) (← links)
- Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- Gross substitution, discrete convexity, and submodularity (Q1410681) (← links)
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)
- Edge splitting and connectivity augmentation in directed hypergraphs. (Q1417568) (← links)
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
- Simpler exchange axioms for M-concave functions on generalized polymatroids (Q1742881) (← links)
- Discrete convexity and unimodularity. I. (Q1763636) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
- Submodular linear programs on forests (Q1919093) (← links)
- Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
- Lattice polyhedra and submodular flows (Q1926644) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Note on the polyhedral description of the Minkowski sum of two L-convex sets (Q2111552) (← links)
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra (Q2237937) (← links)
- Submodularity and its application to some global constraints (Q2364363) (← links)
- A generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Solution concepts for games with general coalitional structure (Q2452810) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
