Pages that link to "Item:Q1188800"
From MaRDI portal
The following pages link to Submodular functions and optimization (Q1188800):
Displaying 50 items.
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- A note on minimizing submodular functions (Q293366) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Generalized roof duality and bisubmodular functions (Q412330) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- On set functions that can be extended to convex functionals (Q556877) (← links)
- A convex representation of totally balanced games (Q655519) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Complexity of tropical Schur polynomials (Q898243) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Submodular function minimization (Q995782) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Submodular set functions and monotone systems in aggregation problems. I (Q1100097) (← links)
- Submodular set functions and monotone systems in aggregation problems. II (Q1107450) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
- Weak \(k\)-majorization and polyhedra (Q1290598) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
- Discrete convex analysis (Q1290668) (← links)
- A necessary and sufficient condition for the convexity in oligopoly games (Q1296504) (← links)
- Minimizing a submodular function arising from a concave function (Q1304480) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- A lexicographic algebraic theorem and its applications (Q1307556) (← links)
- The boundaries of submodular functions (Q1311585) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Tight bounds for capacities (Q1323610) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- Submodular functions and electrical networks (Q1359940) (← links)
- A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
- Structures of subpartitions related to a submodular function minimization (Q1365312) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Block triangularization of skew-symmetric matrices (Q1381281) (← links)
- Minimization of an M-convex function (Q1392577) (← links)
- Subcalculus for set functions and cores of TU games. (Q1394991) (← links)
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
- A greedy algorithm for convex geometries (Q1410695) (← links)
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)
- Improving graph partitions using submodular functions. (Q1410700) (← links)
- A greedy algorithm for some classes of integer programs. (Q1417561) (← links)
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
