The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
From MaRDI portal
Publication:2943828
DOI10.1080/10556788.2014.907290zbMath1325.90014OpenAlexW2113613179MaRDI QIDQ2943828
Sahar Abbasi, Sadoullah Ebrahimnejad
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.907290
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simulated annealing for multi-criteria network path problems
- Multi-objective and multi-constrained non-additive shortest path problems
- On a multicriteria shortest path problem
- Shortest paths in networks with vector weights
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- A reoptimization algorithm for the shortest path problem with time windows
- A multicriteria Pareto-optimal path algorithm
- Vector maximization with two objective functions
- An improved FPTAS for Restricted Shortest Path.
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Multiobjective routing of hazardous materials in stochastic networks
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows
- Minimum cost time-varying network flow problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Dynamic shortest paths minimizing travel times and costs
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- A simple efficient approximation scheme for the restricted shortest path problem
