The problem of the optimal biobjective spanning tree-Reference-Cited by-同舟云学术

The problem of the optimal biobjective spanning tree

Published:1998-12 Issue:3 Volume:111 Page:617-628
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ramos R.M.,Alonso S.,Sicilia J.,González C.

Publisher

Elsevier BV

Subject

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

Reference19 articles.

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993

2. Algorithm for finding optimum trees: Description, use and evaluation;Camerini;Annals of Operations Research,1988

3. Collected papers;Cayley;Quarterly Journal of Mathematics,1987

4. Computer generation of directed trees and complete trees;Chen;International Journal of Electronics,1973

5. Efficient spanning trees;Corley;Journal of Optimization Theory and Applications,1985

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

1. Enhancing Branch-and-Bound for Multiobjective 0-1 Programming;INFORMS Journal on Computing;2023-09-12

2. Branch-and-bound and objective branching with three or more objectives;Computers & Operations Research;2022-12

3. Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs;European Journal of Operational Research;2022-11

4. Fuzzy multi-objective programming: A systematic literature review;Expert Systems with Applications;2022-06

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