Pages that link to "Item:Q912767"

The following pages link to An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767):

Displaying 18 items.

• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
• Routing with nonlinear multiattribute cost functions (Q686201) (← links)
• A combined interactive approach for solving E-convex multiobjective nonlinear programming problem (Q716066) (← links)
• Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
• A bi-objective uncapacitated facility location problem (Q1278144) (← links)
• A multiobjective approach to vendor selection (Q1308876) (← links)
• The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
• On the sum-max bicriterion path problem. (Q1406718) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
• Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← 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)