A mixed integer linear formulation for the minimum label spanning tree problem-Reference-Cited by-同舟云学术

A mixed integer linear formulation for the minimum label spanning tree problem

Published:2009-11 Issue:11 Volume:36 Page:3082-3085
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Captivo M.Eugénia,Clímaco João C.N.,Pascoal Marta M.B.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference10 articles.

1. Metaheuristics comparison for the minimum labelling spanning tree problem;Cerulli,2005

2. The minimum labeling spanning trees;Chang;Information Processing Letters,1997

3. Consoli S, Moreno JA, Mladenović N, Darby-Dowman K. Constructive heuristics for the minimum labelling spanning tree problem: a preliminary comparison. Technical Report DEIOC-4, Universidad de La Laguna, La Laguna, September 2006 〈http://hdl.handle.net/2438/504〉.

4. On the minimum label spanning tree problem;Krumke;Information Processing Letters,1998

5. On the shortest spanning subtree of a graph and the traveling salesman problem;Kruskal;Proceedings of the American Mathematical Society,1956

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

1. The Budgeted Labeled Minimum Spanning Tree Problem;Mathematics;2024-01-10

2. On the Shared Transportation Problem: Computational Hardness and Exact Approach;International Journal of Foundations of Computer Science;2023-05-09

3. An exact reduction technique for the k-Colour Shortest Path Problem;Computers & Operations Research;2023-01

4. The edge-labeled survivable network design problem: Formulations and branch-and-cut;RAIRO - Operations Research;2022-09

5. The Labeled Two Edge Connected Subgraph Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17