Pages that link to "Item:Q1304515"
From MaRDI portal
The following pages link to An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions (Q1304515):
Displaying 18 items.
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- On a bi-dimensional dynamic alternative routing method (Q555940) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
- Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
- Computing all efficient solutions of the biobjective minimum spanning tree problem (Q2384598) (← links)
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance (Q2468381) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution (Q3184581) (← links)
- A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes (Q3557806) (← links)
- Efficiently Generating k-Best Solutions to Procurement Auctions (Q3638445) (← links)
- The determination of the path with minimum-cost norm value (Q4419275) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)