Pages that link to "Item:Q1116889"
From MaRDI portal
The following pages link to Generalized polymatroids and submodular flows (Q1116889):
Displayed 33 items.
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Submodular functions in graph theory (Q686469) (← 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)
- 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)
- Discrete convexity and unimodularity. I. (Q1763636) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← 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)
- Submodular linear programs on forests (Q1919093) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Discrete convexity and equilibria in economies with indivisible goods and money (Q5939410) (← links)
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. (Q5954245) (← links)