The following pages link to (Q4194968):
Displayed 20 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Lattice matrices, intersection of ring families and dicuts (Q1208350) (← links)
- On partitions of a partially ordered set (Q1245831) (← links)
- Optimum partitioning into intersections of ring families (Q1363743) (← links)
- Switchdec polyhedra (Q1363748) (← links)
- K-submodular functions and convexity of their Lovász extension (Q1613409) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- On the submodular matrix representation of a digraph. (Q1853498) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Lattice polyhedra and submodular flows (Q1926644) (← links)
- Abstract flows over time: a first step towards solving dynamic packing problems (Q2250460) (← links)
- Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
- A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
- A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
- Lattices and Maximum Flow Algorithms in Planar Graphs (Q3057636) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- A Hierarchical Model for Cooperative Games (Q5459987) (← links)