Multi-objective and multi-constrained non-additive shortest path problems
From MaRDI portal
Recommendations
- A multi-objective shortest path problem
- Approximating Multiobjective Shortest Path in Practice
- Hierarchical multiobjective shortest path problems
- scientific article; zbMATH DE number 4079184
- On a multicriteria shortest path problem
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- scientific article; zbMATH DE number 792650
- Search for the best compromise solution on multiobjective shortest path problem
- An improved multiobjective shortest path algorithm
Cites work
- scientific article; zbMATH DE number 176744 (Why is no real title available?)
- scientific article; zbMATH DE number 1324130 (Why is no real title available?)
- scientific article; zbMATH DE number 1163721 (Why is no real title available?)
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A label correcting approach for solving bicriterion shortest-path problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Algorithms – ESA 2004
- An empirical investigation of some bicriterion shortest path algorithms
- Extended dominance and a stochastic shortest path problem
- Generalized dynamic programming for multicriteria optimization
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Network flows. Theory, algorithms, and applications.
- On a multicriteria shortest path problem
- Shortest Path Problems with Resource Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The shortest path problem with forbidden paths
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
Cited in
(16)- The transit time constrained fixed charge multi-commodity network design problem
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers
- MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
- The multiple shortest path problem with path deconfliction
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- A multi-objective approach for PH-graphs with applications to stochastic shortest paths
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
- Algorithms – ESA 2004
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
- Finding Multi-Constrained Multiple Shortest Paths
- Finding reliable shortest paths in road networks under uncertainty
- On an exact method for the constrained shortest path problem
- Multicriteria stochastic shortest path problem for electric vehicles
- Non-additive shortest path in the context of traffic assignment
This page was built for publication: Multi-objective and multi-constrained non-additive shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609807)
