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:"maximum-weight connected subgraph problem"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Maximum weight connected subgraph problem
2
Bioinformatics
1
Branch and Bound
1
Branch-and-Bound
1
Branch-and-cut
1
Combinatorial optimization
1
Lagrangian pelaxation
1
Mathematical programming
1
Mathematische Optimierung
1
Reserve set covering problem
1
Theorie
1
Theory
1
Wildlife reserv design
1
complexity
1
exact solution
1
maximum-weight connected subgraph problem
1
node-weighted Steiner tree
1
prize-collecting Steiner tree
1
more ...
less ...
Online availability
All
Undetermined
3
Type of publication
All
Article
3
Type of publication (narrower categories)
All
Article in journal
3
Aufsatz in Zeitschrift
3
Language
All
English
3
Author
All
Sinnl, Markus
2
Álvarez-Miranda, Eduardo
2
Goycoolea, Marcos
1
Koch, Thorsten
1
Ljubić, Ivana
1
Rehfeldt, Daniel Markus
1
Published in...
All
Computers & operations research : and their applications to problems of world concern ; an international journal
1
European journal of operational research : EJOR
1
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences
1
Source
All
ECONIS (ZBW)
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
On the exact solution of prize-collecting Steiner tree problems
Rehfeldt, Daniel Markus
;
Koch, Thorsten
- In:
INFORMS journal on computing : JOC ; charting new …
34
(
2022
)
2
,
pp. 872-889
Persistent link: https://www.econbiz.de/10013361371
Saved in:
2
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Álvarez-Miranda, Eduardo
;
Goycoolea, Marcos
;
Ljubić, Ivana
- In:
European journal of operational research : EJOR
289
(
2021
)
3
,
pp. 1013-1029
Persistent link: https://www.econbiz.de/10012433323
Saved in:
3
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Álvarez-Miranda, Eduardo
;
Sinnl, Markus
- In:
Computers & operations research : and their …
87
(
2017
),
pp. 63-82
Persistent link: https://www.econbiz.de/10011743361
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
