A preference-based approach to spanning trees and shortest paths problems****-Reference-Cited by-同舟云学术

A preference-based approach to spanning trees and shortest paths problems****

Published:2005-05 Issue:3 Volume:162 Page:584-601
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Perny Patrice,Spanjaard Olivier

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference42 articles.

1. General theory of best variants choice;Aizerman;IEEE Transactions on Automatic Control,1981

2. U. Bossong, D. Schweigert, Minimal paths on ordered graphs, Report in Wirtschaftsmathematik no. 24/1997, University of Kaiserslautern, 1997

3. U. Bossong, D. Schweigert, Minimal trees on ordered graphs, Working Paper, 1998

4. Algebraic and Combinatorial Methods in Operations Research;Burkard,1984

5. A theorem on trees;Cayley;Quarterly Journal of Mathematics,1889

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Labeling methods for partially ordered paths;European Journal of Operational Research;2024-10

2. A method for finding a least-cost corridor on an ordinal-scaled raster cost surface;Annals of GIS;2023-01-20

3. Two‐phase strategies for the bi‐objective minimum spanning tree problem;International Transactions in Operational Research;2022-02-08

4. Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs;Information Processing Letters;2021-08

5. Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points;Computers & Operations Research;2020-09