Pages that link to "Item:Q3682236"
From MaRDI portal
The following pages link to Submodular functions and convexity (Q3682236):
Displaying 50 items.
- Generalized polymatroids and submodular flows (Q1116889) (← 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)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- Applications of relaxed submodularity (Q1126827) (← links)
- A submodular approach to discrete dynamic programming (Q1129966) (← links)
- Context dependent probabilistic choice models based on measures of binary advantage (Q1181758) (← links)
- Submodular functions and optimization (Q1188800) (← links)
- Connectivity of submodular functions (Q1199483) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- Discrete convex analysis (Q1290668) (← links)
- The boundaries of submodular functions (Q1311585) (← links)
- An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Equilibrium in a market of intellectual goods (Q1364441) (← links)
- Equilibrium analysis of an economy with innovations (Q1367864) (← links)
- Submodular functions in problems of synthesis of networks (Q1407173) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← 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)
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
- K-submodular functions and convexity of their Lovász extension (Q1613409) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Cores and Weber sets for fuzzy extensions of cooperative games (Q1677658) (← links)
- \(k\)-additive aggregation functions and their characterization (Q1681155) (← links)
- The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set (Q1684119) (← links)
- A note on the Sobol' indices and interactive criteria (Q1697500) (← links)
- The search value of a set (Q1699127) (← links)
- A greedy algorithm for solving ordinary transportation problem with capacity constraints (Q1728270) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- Aggregation-based extensions of fuzzy measures (Q1759619) (← links)
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems (Q1761838) (← links)
- Discrete convexity and unimodularity. I. (Q1763636) (← links)
- Bi-capacities. II: The Choquet integral (Q1770782) (← links)
- A short convex-hull proof for the all-different system with the inclusion property (Q1785324) (← links)
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
- A combinatorial approach to level of repair analysis (Q1840842) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
- A characterization of bisubmodular functions (Q1910557) (← links)
- Lower probabilities and function representation (Q1917291) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- A laminarity property of the polyhedron described by a weakly posi-modular set function (Q1962025) (← links)
