Pages that link to "Item:Q3747243"
From MaRDI portal
The following pages link to Submodular systems and related topics (Q3747243):
Displayed 28 items.
- A vector exchange property of submodular systems (Q760438) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- Submodular function minimization (Q995782) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Permutation polytopes corresponding to strongly supermodular functions (Q1878403) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
- Juegos con corazon no vacio. Una nueva caracterizacion (Q3354492) (← links)
- Cores of games with restricted cooperation (Q4204022) (← links)
- Active-set Methods for Submodular Minimization Problems (Q4637060) (← links)
- A submodular optimization problem with side constraints (Q4645927) (← links)
- Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector (Q4846556) (← links)
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds (Q5101424) (← links)
- A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)