Pages that link to "Item:Q1188800"

The following pages link to Submodular functions and optimization (Q1188800):

Displaying 50 items.

• The English auction with differentiated commodities (Q1577929) (← links)
• An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
• A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
• K-submodular functions and convexity of their Lovász extension (Q1613409) (← links)
• Submodular function minimization with submodular set covering constraints and precedence constraints (Q1644928) (← links)
• Submodular goal value of Boolean functions (Q1701106) (← links)
• \(M\)-convex functions and tree metrics (Q1764353) (← links)
• Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
• A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
• The core of games on convex geometries (Q1806738) (← links)
• On structures of bisubmodular polyhedra (Q1814796) (← links)
• Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
• Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• Discrete polymatroids (Q1863000) (← links)
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
• Disjunctive analogues of submodular and supermodular pseudo-Boolean functions (Q1878401) (← links)
• Permutation polytopes corresponding to strongly supermodular functions (Q1878403) (← links)
• Quadratic M-convex and L-convex functions (Q1883382) (← links)
• Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
• Even and odd marginal worth vectors, Owen's multilinear extension and convex games (Q1897338) (← links)
• A theorem on the principal structure for independent matchings (Q1897351) (← links)
• Minimizing submodular functions over families of sets (Q1906848) (← links)
• Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
• A characterization of bisubmodular functions (Q1910557) (← links)
• Decomposition of a bidirected graph into strongly connected components and its signed poset structure (Q1923614) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• A note on polylinking flow networks (Q1942270) (← links)
• A laminarity property of the polyhedron described by a weakly posi-modular set function (Q1962025) (← links)
• Structural aspects of ordered polymatroids (Q1962039) (← links)
• Extremality of submodular functions (Q1978710) (← links)
• Canonical sequences of monotone measures (Q2036790) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• Log-supermodularity of weight functions, ordering weighted losses, and the loading monotonicity of weighted premiums (Q2276227) (← links)
• Extreme points of the credal sets generated by comparative probabilities (Q2348072) (← links)
• Parametric bisubmodular function minimization and its associated signed ring family (Q2357141) (← links)
• Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• Choquet representability of submodular functions (Q2413102) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
• Adhesivity of polymatroids (Q2455572) (← links)
• A polytope approach to the optimal assembly problem (Q2457910) (← links)
• Sublattices of product spaces: Hulls, representations and counting (Q2477376) (← links)
• The Lovász extension of market games (Q2487783) (← links)