//--> //--> //-->
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:"NP-vollständiges 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
Search: subject:"NP-complete"
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
NP-vollständiges Problem
NP-complete
25
Theorie
19
Theory
16
Mathematical programming
9
Mathematische Optimierung
9
Algorithm
8
Computational complexity
8
Algorithmus
7
NP-complete problems
7
Scheduling problem
7
Scheduling-Verfahren
7
NP-hard
5
Nash equilibrium
5
Nash-Gleichgewicht
5
computational complexity
5
Heuristics
4
NP-Complete
4
Pareto efficiency
4
Combinatorial optimization
3
Heuristik
3
NP complete
3
Nichtkooperatives Spiel
3
Noncooperative game
3
additive preferences
3
approximation algorithm
3
coalition formation
3
hedonic games
3
Additive Preferences
2
Algorithms
2
Bottleneck
2
Coalition Formation
2
Complexity Theory
2
Complexity theory
2
Computational Complexity
2
Core
2
Durchlaufzeit
2
Dynamic programming
2
Engpass
2
Entscheidungstheorie
2
more ...
less ...
Online availability
All
Free
1
Type of publication
All
Book / Working Paper
3
Type of publication (narrower categories)
All
Arbeitspapier
1
Graue Literatur
1
Hochschulschrift
1
Non-commercial literature
1
Thesis
1
Working Paper
1
Language
All
English
2
German
1
Author
All
Bauch, Martin
1
Breit, Joachim
1
Burke, Edmund
1
Schmidt, Günter
1
Institution
All
PATAT <2, 1997, Toronto>
1
Published in...
All
Discussion papers / Department of Economics, University of Saarland
1
Lecture notes in computer science
1
Source
All
ECONIS (ZBW)
2
USB Cologne (EcoSocSci)
1
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Kombinatorische Verfahren mit Qualitätsgarantien zur Schichtplanung von Call-Center-Agenten
Bauch, Martin
-
2012
problem is
NP-complete
and even inapproximable. A broad statistical analysis of call data from a call centre is contained, too. …
Persistent link: https://www.econbiz.de/10009632961
Saved in:
2
Two-machine openshop scheduling with an availability constraint
Breit, Joachim
-
2000
Persistent link: https://www.econbiz.de/10013383921
Saved in:
3
Practice and theory of automated timetabling II : second international conference ; selected papers
Burke, Edmund
(
contributor
)
-
1998
Persistent link: https://www.econbiz.de/10004593741
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->