Pages that link to "Item:Q5131480"

The following pages link to Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480):

Displaying 15 items.

• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
• Submodular function minimization and polarity (Q2097629) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
• Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
• (Q4998944) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
• Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)