The following pages link to (Q3682236):
Displaying 50 items.
- On \(b\)-bistochastic quadratic stochastic operators (Q264972) (← links)
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Axiomatizations of Lovász extensions of pseudo-Boolean functions (Q409758) (← links)
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions (Q412326) (← links)
- Is submodularity testable? (Q472463) (← links)
- A simple proof for the convexity of the Choquet integral (Q491689) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Sandwich games (Q494342) (← links)
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms (Q518316) (← links)
- A discrete Choquet integral for ordered systems (Q533162) (← links)
- On set functions that can be extended to convex functionals (Q556877) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Generalized roof duality (Q714031) (← links)
- Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- The concave integral over large spaces (Q835201) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- Subjective independence and concave expected utility (Q896936) (← links)
- Absolutely determined matrices (Q923677) (← links)
- Bipolarization of posets and natural interpolation (Q924248) (← links)
- Distribution functions of linear combinations of lattice polynomials from the uniform distribu\-tion (Q928968) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions (Q967323) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- On the moments and distribution of discrete Choquet integrals from continuous distributions (Q1026432) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Scheduling multiprocessor UET tasks of two sizes (Q1034607) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Sandwich theorems for set functions (Q1114795) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)