Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Indaco Biazzo
Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs
Physical Review E
Related publications
Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
The Minimum Steiner Tree Problem Based on Genetic Algorithm
DEStech Transactions on Computer Science and Engineering
Prize-Collecting Steiner Network Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Steiner Tree Construction Based on Spanning Graphs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Electrical
Software
Computer Graphics
Computer-Aided Design
Electronic Engineering
Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs
A Prize Collecting Steiner Tree Approach to Least Cost Evaluation of Grid and Off-Grid Electrification Systems
Energy
Management
Monitoring
Manufacturing Engineering
Electrical
Policy
Mechanical Engineering
Energy Engineering
Sustainability
Construction
Modeling
Law
Building
Electronic Engineering
Renewable Energy
Fuel Technology
Structural Engineering
Simulation
Power Technology
Pollution
Industrial
Civil
Energy
the Environment
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem
Computational Geometry: Theory and Applications
Control
Optimization
Geometry
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Topology
Improvement of Steiner Tree Algorithm: Branch-Based Multi-Cast
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
