Mean‐standard deviation model for minimum cost flow problem
From MaRDI portal
Publication:6179689
DOI10.1002/net.22135zbMath1529.90080OpenAlexW2937665126MaRDI QIDQ6179689
Avinash Unnikrishnan, Stephen D. Boyles, Can Gokalp
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22135
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal path problems with second-order stochastic dominance constraints
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- On finding representative non-dominated points for bi-objective integer network flow problems
- A literature survey of benchmark functions for global optimisation problems
- Multiple objective minimum cost flow problems: a review
- Optimal routing for maximizing the travel time reliability
- Extended dominance and a stochastic shortest path problem
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- Bicriteria network flow problems: Continuous case
- Efficient solutions for the bicriteria network flow problem
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- A generalized theorem of the maximum
- Robust discrete optimization and network flows
- The biobjective minimum cost flow problem
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Complexity and algorithms for nonlinear optimization problems
- Arriving on time
- A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- Two-Segment Separable Programming
- Multipoint methods for separable nonlinear networks
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- The Variance-Constrained Shortest Path Problem
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Robust and Adaptive Network Flows
- Optimal Flows in Stochastic Dynamic Networks with Congestion
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
