Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Academic Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"Node Weighted Steiner Tree Problem"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Node Weighted Steiner Tree Problem
1
knapsack constraint
1
relax and cut algorithm
1
Online availability
All
Undetermined
1
Type of publication
All
Article
1
Language
All
Undetermined
1
Author
All
CORDONE, ROBERTO
1
TRUBIAN, MARCO
1
Published in...
All
Asia-Pacific Journal of Operational Research (APJOR)
1
Source
All
RePEc
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK
NODE
WEIGHTED
STEINER
TREE
PROBLEM
CORDONE, ROBERTO
;
TRUBIAN, MARCO
- In:
Asia-Pacific Journal of Operational Research (APJOR)
25
(
2008
)
03
,
pp. 373-391
The Knapsack
Node
Weighted
Steiner
Tree
Problem
(KNWSTP) is a generalization of the Steiner Tree Problem on graphs …
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005047130
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
