Pages that link to "Item:Q1824552"

The following pages link to On the supermodular knapsack problem (Q1824552):

Displaying 23 items.

• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
• On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
• Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
• A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
• The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
• Knapsack problems with dependencies through non-additive measures and Choquet integral (Q2140163) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
• A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249) (← links)