Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
special cases
Description:
Instances of a general mathematical problem or rule that have particular properties or constraints and may admit distinct analysis or solutions.
Wikidata ID:
wiki/Q2890061
OpenAlex ID:
keywords/special-cases
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
1990
·
Herbert Edelsbrunner
, Ernst Peter Mücke
·
ACM Transactions on Graphics
·
830
PDF
An Exploration in the Theory of Optimum Income Taxation
2006
·
James A. Mirrlees
·
Oxford University Press eBooks
·
336
Personnel scheduling: Models and complexity
2010
·
Peter Brucker
, Rong Qu
, et al.
·
European Journal of Operational Research
·
231
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
1998
·
Rainer E. Burkard
, Vladimir G. Deineko
, et al.
·
SIAM Review
·
200
PDF
Minimizing the makespan in a two-machine cross-docking flow shop problem
2007
·
Feng Chen
, Chung-Yee Lee
·
European Journal of Operational Research
·
169
Machine scheduling with deliveries to multiple customer locations
2004
·
Chung-Lun Li
, George Vairaktarakis
, et al.
·
European Journal of Operational Research
·
150
On the classical solutions of the initial value problem for the unmodified non‐linear vlasov equation II special cases
1982
·
E. Horst
, H. Neunzert
·
Mathematical Methods in the Applied Sciences
·
145
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
1988
·
H. Edelsbrunner
, E. P. Mücke
·
Annual Symposium on Computational Geometry (SoCG)
·
135
PDF
A Special Case of a Bivariate Non-Central t-Distribution
1965
·
D. B. OWEN
·
Biometrika
·
122
Minimizing Makespan in a Class of Reentrant Shops
1997
·
M. Y. Wang
, S. P. Sethi
, et al.
·
Operations Research
·
119
Kiintymyssuhdeteorian kliininen merkitys: soveltaminen erityistilanteissa
2001
·
Mirjam Kalland
·
114
On the complexity of manpower shift scheduling
1996
·
Hoong Chuin Lau
·
Computers & Operations Research
·
114
Boolean operations of 2-manifolds through vertex neighborhood classification
1986
·
Martti Mäntylä
·
ACM Transactions on Graphics
·
107
PDF
On the complexity of coupled-task scheduling
1997
·
A.J. Orman
, C.N. Potts
·
Discrete Applied Mathematics
·
101
Complexity results for parallel machine problems with a single server
2002
·
Peter Brucker
, Clarisse Dhaenens-Flipo
, et al.
·
Journal of Scheduling
·
99
Multi Index Assignment Problems: Complexity, Approximation, Applications
2000
·
Frits C. R. Spieksma
·
Combinatorial optimization
·
96
Robustness in Geometric Computations*
2001
·
Christoph M. Hoffmann
·
Journal of Computing and Information Science in Engineering
·
86
Two due date assignment problems in scheduling a single machine
2006
·
Dvir Shabtay
, George Steiner
·
Operations Research Letters
·
82
A concise survey of efficiently solvable special cases of the permutation flow-shop problem
1983
·
C. L. Monma
, A. H. G. Rinnooy Kan
·
RAIRO - Operations Research
·
78
PDF
Determination of common due window location in a single machine scheduling problem
1996
·
Surya D. Liman
, Shrikant S. Panwalkar
, et al.
·
European Journal of Operational Research
·
68
Complexity of single machine scheduling subject to nonnegative inventory constraints
2010
·
Dirk Briskorn
, Byung-Cheon Choi
, et al.
·
European Journal of Operational Research
·
65
Numerische Berechnung eines Spezialfalles des Dreikörperproblems
1913
·
Carl Burrau
·
Astronomische Nachrichten
·
65
PDF
On no-wait and no-idle flow shops with makespan criterion
2006
·
Pawel Jan Kalczynski
, Jerzy Kamburowski
·
European Journal of Operational Research
·
64
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
1999
·
J. A. Hoogeveen
, T. Kawaguchi
·
Mathematics of Operations Research
·
62
Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms
2003
·
M.A. Cornea-Hasegan
, R.A. Golliver
, et al.
·
IEEE Symposium on Computer Arithmetic (ARITH)
·
61
Show more works
View as search
Works count:
1,244
Citation count:
6,340
Year
Topic
Type