DOI10.1016/0166-218X(81)90004-4zbMath0466.90056OpenAlexW2011565421MaRDI QIDQ1155516
Hiroaki Ishii, Toshio Nishida, Yoshikazu Namasuya, Shôgo Shiode
Publication date: 1981
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(81)90004-4
Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights,
Using sparsification for parametric minimum spanning tree problems,
Confidence regional method of stochastic spanning tree problem,
A fully polynomial time approximation scheme for the probability maximizing shortest path problem,
A two-level solution approach for solving the generalized minimum spanning tree problem,
On a discrete optimization problem,
Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness,
A stronger lower bound on parametric minimum spanning trees,
An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion,
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems,
Polyhedral results for a class of cardinality constrained submodular minimization problems,
Polymatroids and mean-risk minimization in discrete optimization,
Risk averse submodular utility maximization,
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra,
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances,
Interval elimination method for stochastic spanning tree problem,
Genetic algorithm approach on multi-criteria minimum spanning tree problem,
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems,
Fuzzy α-minimum spanning tree problem: definition and solutions,
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction,
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program,
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems,
Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function,
The submodular knapsack polytope,
A polynomial time algorithm for a chance-constrained single machine scheduling problem,
The stochastic bottleneck linear programming problem,
An efficient algorithm for the parametric resource allocation problem,
C-programming problems: A class of non-linear optimization problems,
On type-2 fuzzy weighted minimum spanning tree,
Analysis of a class of proxy problems,
A class of nonseparable dynamic programming problems
