Mean‐standard deviation model for minimum cost flow problem
From MaRDI portal
Recommendations
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- scientific article; zbMATH DE number 147499
- The minimal average cost flow problem
- A variational approach for minimum cost flow problems
- Minimizing mean flow time with error constraint
- Minimizing variation in stochastic flow shop
- Minimum mean-squared deviation method for stochastic complementarity problems
- Uncertain minimum cost flow problem
- Robust minimum cost flow problem under consistent flow constraints
Cites work
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A generalized theorem of the maximum
- A literature survey of benchmark functions for global optimisation problems
- A mean-risk model for the traffic assignment problem with stochastic travel times
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Arriving on time
- Bicriteria network flow problems: Continuous case
- Complexity and algorithms for nonlinear optimization problems
- Efficient solutions for the bicriteria network flow problem
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Extended dominance and a stochastic shortest path problem
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Finding non-dominated solutions in bi-objective integer network flow problems
- scientific article; zbMATH DE number 6382860 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- Multiple objective minimum cost flow problems: a review
- Multipoint methods for separable nonlinear networks
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- On finding representative non-dominated points for bi-objective integer network flow problems
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Optimal Flows in Stochastic Dynamic Networks with Congestion
- Optimal path problems with second-order stochastic dominance constraints
- Optimal routing for maximizing the travel time reliability
- Robust and adaptive network flows
- Robust discrete optimization and network flows
- Robust optimization
- The biobjective minimum cost flow problem
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- The Variance-Constrained Shortest Path Problem
- Two-Segment Separable Programming
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
This page was built for publication: Mean‐standard deviation model for minimum cost flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179689)
