The following pages link to Stochastic spanning tree problem (Q1155516):
Displaying 31 items.
- C-programming problems: A class of non-linear optimization problems (Q798261) (← links)
- Analysis of a class of proxy problems (Q801816) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A class of nonseparable dynamic programming problems (Q1075255) (← links)
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- Risk averse submodular utility maximization (Q1785423) (← links)
- Interval elimination method for stochastic spanning tree problem (Q1805284) (← links)
- Genetic algorithm approach on multi-criteria minimum spanning tree problem (Q1809832) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104) (← links)
- Confidence regional method of stochastic spanning tree problem (Q1905852) (← links)
- On type-2 fuzzy weighted minimum spanning tree (Q2100494) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Fuzzy α-minimum spanning tree problem: definition and solutions (Q2817092) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights (Q3448630) (← links)
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
- On a discrete optimization problem (Q4323418) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
