scholarly journals Linear programming in low dimensions

2011 ◽  
pp. 203-215
Author(s):  
Sariel Har-Peled
Keyword(s):  
Linear Programming ◽  
Low Dimensions

scholarly journals An Exact Algorithm for Steiner Tree Problem on Graphs

2006 ◽  
Vol 1 (1) ◽  
pp. 41 ◽  
Author(s):  
Milan Stanojevic ◽  
Mirko Vujoševic
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Open Source Software ◽  
Steiner Tree ◽  
Exact Algorithm ◽  
Steiner Tree Problem ◽  
Node Degree ◽  
Low Dimensions ◽  
Original Algorithm ◽  
Linear Programming Problems

The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm is simple and intended for solving problems with relatively low dimensions. It is based on use of existing open source software for solving integer linear programming problems. The algorithm is tested and shown very efficient for different randomly generated problems on graphs of up to 50 nodes, up to 10 terminals and average node degree 7.

Elementary Linear Programming (2nd edition)

1997 ◽  
Vol 48 (7) ◽  
pp. 757-758
Author(s):  
B Kolman ◽  
R E Beck ◽  
M J Panik
Keyword(s):  
Linear Programming
Sign in / Sign up

Export Citation Format

Share Document