Skip to main navigation
Skip to search
Skip to main content
Penn State Home
Help & FAQ
Link opens in a new tab
Search content at Penn State
Home
Researchers
Research output
Research units
Equipment
Grants & Projects
Prizes
Activities
An ant colony algorithm for the Steiner problem in graphs
Minseok Seo
,
José A. Ventura
Harold and Inge Marcus Department of Industrial and Manufacturing Engineering
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An ant colony algorithm for the Steiner problem in graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Steiner Problem
100%
Terminal Node
50%
Pheromone Value
50%
Step Reduction
50%
Reduction Rules
50%
Mathematics
Edge
100%
Step Procedure
100%
Computer Science
Directed Graphs
100%