A relax-and-cut algorithm for the Knapsack Node Weighted Steiner Tree Problem
Year of publication: |
2008
|
---|---|
Authors: | Cordone, Roberto ; Trubian, Marco |
Published in: |
Asia Pacific journal of operational research : APJOR. - Singapore : ORSS, ISSN 0217-5959, ZDB-ID 52932-1. - Vol. 25.2008, 3, p. 373-391
|
Subject: | Steinerbaumproblem; Steiner Tree Problem | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Approximation algorithms for connected facility location problems
Hasan, Mohammad Khairul, (2008)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Constraint-driven exact algorithm for the manufacturing cell formation problem
Merchichi, Sabrina, (2015)
- More ...
-
Column-generation based bounds for the Homogeneous Areas Problem
Colombo, Fabio, (2014)
-
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
CORDONE, ROBERTO, (2008)
-
Column-generation based bounds for the homogeneous areas problem
Colombo, Fabio, (2014)
- More ...