Pages that link to "Item:Q957370"

The following pages link to Polymatroids and mean-risk minimization in discrete optimization (Q957370):

Displaying 41 items.

• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• A novel probabilistic formulation for locating and sizing emergency medical service stations (Q492857) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Capacitated location model with online demand pooling in a multi-channel supply chain (Q992600) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
• A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• Risk averse submodular utility maximization (Q1785423) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← 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)
• Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• On distributionally robust chance constrained programs with Wasserstein distance (Q2227531) (← links)
• A computational study for common network design in multi-commodity supply chains (Q2257365) (← 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)
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
• Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
• A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
• Two-echelon supply chain network design with trade credit (Q2668698) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty (Q2806955) (← links)
• Submodular Formulations for Range Assignment Problems (Q2883570) (← links)
• Aircraft Rescheduling with Cruise Speed Control (Q2931703) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information (Q4687246) (← links)
• Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Efficient Solution Methods for a General <i>r</i>-Interdiction Median Problem with Fortification (Q5086024) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← 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)