Pages that link to "Item:Q1850505"

The following pages link to A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505):

Displaying 50 items.

• Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
• Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• Is submodularity testable? (Q472463) (← links)
• Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Efficient designs for Bayesian networks with sub-tree bounds (Q518229) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• Minimum degree orderings (Q848936) (← links)
• Designing two-echelon supply networks (Q859921) (← links)
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
• Testing branch-width (Q875941) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Partitioning posets (Q943378) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← 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)
• Approximability of clausal constraints (Q970111) (← links)
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
• Semiconductor lot allocation using robust optimization (Q976354) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• Submodular function minimization (Q995782) (← links)
• A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
• Improved bound for the Carathéodory rank of the bases of a matroid (Q1400967) (← links)
• A note on Schrijver's submodular function minimization algorithm. (Q1400972) (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
• A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• The mixed evacuation problem (Q1631682) (← links)
• Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• Spanning tree with lower bound on the degrees (Q1744244) (← links)
• L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Biased positional games on matroids (Q1765611) (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
• A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• Robust monotone submodular function maximization (Q1801019) (← links)