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.

• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• Robust monotone submodular function maximization (Q1801019) (← links)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
• Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
• Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
• A note on submodular function minimization by Chubanov's LP algorithm (Q2010920) (← links)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Permutatorial optimization via the permutahedron (Q2083997) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Submodular function minimization and polarity (Q2097629) (← links)
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
• Reachability in arborescence packings (Q2166224) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Effective divisor classes on metric graphs (Q2172484) (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
• A variation of DS decomposition in set function optimization (Q2185813) (← links)
• The \(b\)-branching problem in digraphs (Q2192110) (← links)
• Optimal Boolean lattice-based algorithms for the U-curve optimization problem (Q2200667) (← links)
• A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
• The median partition and submodularity (Q2245064) (← links)
• Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
• Set function optimization (Q2314057) (← links)
• Discrete Newton methods for the evacuation problem (Q2330131) (← links)
• Generalized skew bisubmodularity: a characterization and a min-max theorem (Q2339806) (← links)
• Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
• A tight analysis of the submodular-supermodular procedure (Q2345618) (← links)
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← links)
• Submodular functions: from discrete to continuous domains (Q2414912) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands (Q2433468) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• Computing an element in the lexicographic kernel of a game (Q2474551) (← links)
• The warehouse-retailer network design game (Q2514656) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)