Pages that link to "Item:Q958463"
From MaRDI portal
The following pages link to A comparison of solution strategies for biobjective shortest path problems (Q958463):
Displaying 50 items.
- Multiobjective shortest path problems with lexicographic goal-based preferences (Q297067) (← links)
- Bi-objective robust optimisation (Q322907) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- Path based algorithms for metro network design (Q337631) (← links)
- A simulated annealing for multi-criteria network path problems (Q339658) (← links)
- Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
- Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323) (← links)
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
- Acceleration strategies for the weight constrained shortest path problem with replenishment (Q479240) (← links)
- Solving multi-objective traffic assignment (Q490239) (← links)
- An aggregate label setting policy for the multi-objective shortest path problem (Q613476) (← links)
- An interactive algorithm for multi-objective route planning (Q639934) (← links)
- Lower bound sets for biobjective shortest path problems (Q905755) (← links)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- An evolutionary approach to generalized biobjective traveling salesperson problem (Q1652174) (← links)
- The energy-constrained quickest path problem (Q1676484) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load (Q1784845) (← links)
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles (Q2005853) (← links)
- A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
- Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- A discrete optimisation approach for target path planning whilst evading sensors (Q2669689) (← links)
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
- Simple and efficient bi-objective search algorithms via fast dominance checks (Q2680770) (← links)
- Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems (Q2800805) (← links)
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem (Q2980909) (← links)
- Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications (Q3649619) (← links)
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
- Finding shortest and dissimilar paths (Q6071084) (← links)
- Solving the multi‐objective bike routing problem by meta‐heuristic algorithms (Q6079858) (← links)
