Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem

Networks - United States
doi 10.1002/net.21857
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2019English

New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2019English

Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs

Physical Review E
2012English

Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks

English

A New Bound for the 2-Edge Connected Subgraph Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Prize-Collecting Steiner Network Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Steiner Tree Reoptimization Problem With Sharpened Triangle Inequality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy