The shortest path problem with two objective functions-Reference-Cited by-同舟云学术

The shortest path problem with two objective functions

Published:1986-05 Issue:2 Volume:25 Page:281-291
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Henig Mordechai I.

Publisher

Elsevier BV

Subject

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

Reference20 articles.

1. Nonlinear Programming Theory and Algorithms;Bazaraa,1979

2. Dynamic Programming;Bellman,1957

3. Dynamic programming in multiplicative lattices;Brown;Journal of Mathematics and Applications,1965

4. A bicriterion shortest path algorithm;Climaco;European Journal of Operation Research,1982

5. Note on multiple objective dynamic programming;Daellenbach;Journal of the Operational Research Society,1980

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

1. All-or-Nothing Concurrent Entanglement Routing;ICC 2024 - IEEE International Conference on Communications;2024-06-09

2. An integrated assignment, routing, and speed model for roadway mobility and transportation with environmental, efficiency, and service goals;Transportation Research Part C: Emerging Technologies;2023-07

3. Estimating Path Travel Costs in Large-Scale Networks Using Machine-Learning Techniques;Transportation Research Record: Journal of the Transportation Research Board;2023-06-07

4. Adapt Load Behavior as Technology Agnostic Solution;Power Electronics and Power Systems;2023

5. A multi-constrained multi-path non-overlapping routing algorithm for deterministic networking;2nd International Conference on Internet of Things and Smart City (IoTSC 2022）;2022-05-08