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:"K-approximation sets and functions"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Mathematical programming
3
Mathematische Optimierung
3
FPTAS
2
K-approximation sets and functions
2
Theorie
2
Theory
2
Algorithm
1
Algorithmus
1
Combinatorial optimization
1
Durchlaufzeit
1
Dynamic programming
1
Dynamic scheduling
1
Dynamische Optimierung
1
Estimation theory
1
Ganzzahlige Optimierung
1
Geometric rounding
1
Integer programming
1
Inventory model
1
Lagerhaltungsmodell
1
Lead time
1
Nichtlineare Optimierung
1
Non-linear boolean programming
1
Nonlinear programming
1
Production control
1
Produktionssteuerung
1
Scheduling problem
1
Scheduling-Verfahren
1
Schätztheorie
1
Stochastic process
1
Stochastischer Prozess
1
approximation algorithms
1
inventory control
1
k-approximation sets and functions
1
sample average approximation
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
Halman, Nir
3
Kellerer, Hans
1
Strusevich, Vitaly A.
1
Published in...
All
European journal of operational research : EJOR
1
INFORMS journal on computing : JOC
1
Journal of scheduling : JOS
1
Source
All
ECONIS (ZBW)
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Provably near-optimal approximation schemes for implicit stochastic and sample-based dynamic programs
Halman, Nir
- In:
INFORMS journal on computing : JOC
32
(
2020
)
4
,
pp. 1157-1181
Persistent link: https://www.econbiz.de/10012390216
Saved in:
2
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
Halman, Nir
- In:
Journal of scheduling : JOS
23
(
2020
)
6
,
pp. 643-648
Persistent link: https://www.econbiz.de/10012417547
Saved in:
3
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints
Halman, Nir
;
Kellerer, Hans
;
Strusevich, Vitaly A.
- In:
European journal of operational research : EJOR
270
(
2018
)
2
,
pp. 435-447
Persistent link: https://www.econbiz.de/10011869039
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
