Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
worst-case performance
Description:
A measure of a system or method’s behavior under the most adverse conditions, used in control, filtering, and performance analysis.
OpenAlex ID:
keywords/worst-case-performance
Complexity of vehicle routing and scheduling problems
1981
·
J. K. Lenstra
, A. H. G. Rinnooy Kan
·
Networks
·
1,655
PDF
Packet classification on multiple fields
1999
·
Pankaj Gupta
, Nick McKeown
·
ACM SIGCOMM Conference (SIGCOMM)
·
632
PDF
Robust Markov Decision Processes
2012
·
Wolfram Wiesemann
, Daniel Kuhn
, et al.
·
Mathematics of Operations Research
·
615
Pricing American Options: A Duality Approach
2004
·
Martin B. Haugh
, Leonid Kogan
·
Operations Research
·
538
Algorithms for Knapsack Problems
1987
·
Silvano Martello
, Paolo Toth
·
North-Holland mathematics studies
·
504
A Vehicle Routing Problem with Stochastic Demand
1992
·
Dimitris J. Bertsimas
·
Operations Research
·
471
Robustness and Linear Contracts
2015
·
Gabriel Carroll
·
American Economic Review
·
449
Exact Solution of the Two-Dimensional Finite Bin Packing Problem
1998
·
Silvano Martello
, Daniele Vigo
·
Management Science
·
439
Dynamic Steiner Tree Problem
1991
·
Makoto Imase
, Bernard M. Waxman
·
SIAM Journal on Discrete Mathematics
·
432
Deterministic memory-efficient string matching algorithms for intrusion detection
2005
·
N. Tuck
, T. Sherwood
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
422
Denial of service via algorithmic complexity attacks
2003
·
Scott A. Crosby
, Dan S. Wallach
·
Rice Research Repository (Rice University)
·
421
Round-robin scheduling for max-min fairness in data networks
1991
·
E.L. Hahne
·
IEEE Journal on Selected Areas in Communications
·
415
Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
1995
·
Richard L. Daniels
, Panagiotis Kouvelis
·
Management Science
·
395
Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
1993
·
Paul M. Thompson
, Harilaos N. Psaraftis
·
Operations Research
·
376
Lower bounds and reduction procedures for the bin packing problem
1990
·
Silvano Martello
, Paolo Toth
·
Discrete Applied Mathematics
·
353
Should model-based inverse inputs be used as feedforward under plant uncertainty?
2002
·
S. Devasia
·
IEEE Transactions on Automatic Control
·
332
Single Machine Scheduling with Learning Effect Considerations
2000
·
T.C. Edwin Cheng
, Guoqing Wang
·
Annals of Operations Research
·
321
R×W: a scheduling approach for large-scale on-demand data broadcast
1999
·
D. Aksoy
, M. Franklin
·
IEEE/ACM Transactions on Networking
·
306
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
2002
·
Gregory Gutin
, Anders Yeo
, et al.
·
Discrete Applied Mathematics
·
290
Robust H ∞ glucose control in diabetes using a physiological model
2000
·
Robert S. Parker
, Francis J. Doyle
, et al.
·
AIChE Journal
·
283
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
1982
·
A. M. Frieze
, G. Galbiati
, et al.
·
Networks
·
282
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
1998
·
T. V. Lakshman
, D. Stiliadis
·
ACM SIGCOMM Computer Communication Review
·
262
PDF
Heuristic analysis, linear programming and branch and bound
1980
·
Laurence A. Wolsey
·
Mathematical programming studies
·
253
A scenario-aware data flow model for combined long-run average and worst-case performance analysis
2006
·
B.D. Theelen
, M.C.W. Geilen
, et al.
·
ACM/IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE)
·
227
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
1991
·
J.A. Hoogeveen
·
Operations Research Letters
·
226
PDF
Show more works
View as search
Works count:
1,273
Citation count:
26,530
Year
Topic
Type