Improving Linear Programming Approaches for the Steiner Tree Problem-Reference-Cited by-同舟云学术

Improving Linear Programming Approaches for the Steiner Tree Problem

Published:2003 Issue: Volume: Page:1-14
ISSN:0302-9743
Container-title:Experimental and Efficient Algorithms
language:
Short-container-title:

Author:

Althaus Ernst,Polzin Tobias,Daneshmand Siavash Vahdati

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44867-5_1

Reference25 articles.

1. Research Report;E. Althaus,2003

2. Y. P. Aneja. An integer linear programming approach to the Steiner problem in graphs. Networks, 10:167–178, 1980.

3. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. Finding cuts in the TSP (A preliminary report). Technical report, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, Piscataway, NJ, 1995.

4. Lect Notes Comput Sci;D. Applegate,2001

5. E. Balas and M. Padberg. On the set-covering problem: II. An algorithm for set partitioning. Operations Research, 23:74–90, 1975.

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

1. A graph-theoretic approach to identifying acoustic cues for speech sound categorization;Psychonomic Bulletin & Review;2020-07-15

2. An improved EDA for solving Steiner tree problem;Concurrency and Computation: Practice and Experience;2015-03-17

3. Solving the quorumcast routing problem by constraint programming;Constraints;2012-07-08

4. A branch-and-cut algorithm for the Steiner tree problem with delays;Optimization Letters;2011-07-22

5. Approaches to the Steiner Problem in Networks;Algorithmics of Large and Complex Networks;2009