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:"bounded treewidth"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Mathematical programming
2
Mathematische Optimierung
2
bounded treewidth
2
inapproximability
2
many-to-one matching
2
maximum matching
2
project allocation
2
Algorithm
1
Algorithmus
1
Allocation
1
Allokation
1
Bounded tree-width
1
Bounded treewidth
1
Dynamic programming
1
Dynamische Optimierung
1
Economic model
1
Electronics
1
Elektronik
1
Fitness landscape
1
Graph theory
1
Graphentheorie
1
Industrie
1
Integrated circuit manufacturing
1
Local search
1
Long path
1
Manufacturing industries
1
Matching
1
Project management
1
Projektmanagement
1
Search theory
1
Steepest ascent
1
Suchtheorie
1
Theorie
1
Theory
1
USA
1
United States
1
VCSP
1
Welfare analysis
1
Wirtschaftsmodell
1
Wohlfahrtsanalyse
1
more ...
less ...
Online availability
All
Free
2
Undetermined
2
Type of publication
All
Article
2
Book / Working Paper
2
Type of publication (narrower categories)
All
Article in journal
2
Aufsatz in Zeitschrift
2
Working Paper
2
Arbeitspapier
1
Graue Literatur
1
Non-commercial literature
1
Language
All
English
4
Author
All
Arulselvan, Ashwin
2
Cseh, Ágnes
2
Groß, Martin
2
Manlove, David F.
2
Matuschke, Jannik
2
Ait-Ferhat, Dehia
1
Cohen, David A.
1
Cooper, Martin C.
1
Juliard, Vincent
1
Kaznatcheev, Artem
1
Stauffer, Gautier
1
Torres, Juan Andres
1
Wallace, Mark
1
more ...
less ...
Published in...
All
Operations research letters
2
IEHAS Discussion Papers
1
Mu̐helytanulmányok / Magyar Tudományos Akadémia, Közgazdaságtudományi Intézet
1
Source
All
ECONIS (ZBW)
3
EconStor
1
Showing
1
-
4
of
4
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Matchings with lower quotas: Algorithms and complexity
Arulselvan, Ashwin
;
Cseh, Ágnes
;
Groß, Martin
; …
-
2017
for instances with
bounded
treewidth
; however, the corresponding runtime is exponential in the treewidth with the maximum …
Persistent link: https://www.econbiz.de/10011944921
Saved in:
2
Matchings with lower quotas : algorithms and complexity
Arulselvan, Ashwin
;
Cseh, Ágnes
;
Groß, Martin
; …
-
2017
for instances with
bounded
treewidth
; however, the corresponding runtime is exponential in the treewidth with the maximum …
Persistent link: https://www.econbiz.de/10011757194
Saved in:
3
The k-path coloring problem in graphs of
bounded
treewidth
: an application in integrated circuit manufacturing
Ait-Ferhat, Dehia
;
Juliard, Vincent
;
Stauffer, Gautier
; …
- In:
Operations research letters
48
(
2020
)
5
,
pp. 652-657
Persistent link: https://www.econbiz.de/10012303433
Saved in:
4
Steepest ascent can be exponential in
bounded
treewidth
problems
Cohen, David A.
;
Cooper, Martin C.
;
Kaznatcheev, Artem
; …
- In:
Operations research letters
48
(
2020
)
3
,
pp. 217-224
Persistent link: https://www.econbiz.de/10012254055
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
