Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
~subject:"Scheduling problem"
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
Super-polynomial approximation...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Scheduling problem
Mathematical programming
7
Mathematische Optimierung
7
Theorie
6
Theory
6
Algorithm
4
Algorithmus
4
Graph theory
3
Graphentheorie
3
Complexity
2
Estimation theory
2
NP-complete problem
2
Polynomial approximation
2
Scheduling-Verfahren
2
Schätztheorie
2
approximation algorithm
2
traveling salesman
2
Approximation
1
Approximation algorithm
1
Bottleneck
1
Branch and Bound
1
Branch-and-Bound
1
Charges
1
Combinatorial optimization
1
Decision
1
Decision under uncertainty
1
Dense subgraphs
1
Engpass
1
Entscheidung
1
Entscheidung unter Unsicherheit
1
Exact algorithm
1
Exact and parameterized algorithms
1
Game theory
1
Gebühr
1
Graph
1
MAX SAT
1
Moderately exponential approximation
1
Nash equilibrium
1
Nash-Gleichgewicht
1
Parameterized algorithm
1
more ...
less ...
Online availability
All
Undetermined
1
Type of publication
All
Article
2
Type of publication (narrower categories)
All
Article in journal
2
Aufsatz in Zeitschrift
2
Language
All
English
2
Author
All
Paschos, Vangelis Th.
2
Bourgeois, Nicolas
1
Della Croce, Federico
1
Giannakos, Aristotelis
1
Lucarelli, Giorgio
1
Milis, Ioannis
1
Published in...
All
European journal of operational research : EJOR
1
Operational research : an international journal ; the scientific journal of the Hellenic Operational Research Society
1
Source
All
ECONIS (ZBW)
2
Showing
1
-
2
of
2
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
Della Croce, Federico
;
Paschos, Vangelis Th.
- In:
Operational research : an international journal ; the …
8
(
2008
)
3
,
pp. 235-256
Persistent link: https://www.econbiz.de/10003764741
Saved in:
2
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
Bourgeois, Nicolas
;
Giannakos, Aristotelis
;
Lucarelli, …
- In:
European journal of operational research : EJOR
262
(
2017
)
3
,
pp. 894-903
Persistent link: https://www.econbiz.de/10011802282
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
