Referencias Analíticas
*
Uniform multicommodity flow through the complete graph with random edge-capacities
Aldous, David J.
; McDiarmid, Colin
; Scott, Alex
pp. 299-302
|
*
The counting complexity of a simple scheduling problem
Berbeglia, Gerardo
pp. 365-367
|
*
Risk-sensitive dynamic pricing for a single perishable product
Li, Michael Z.F.
; Zhuang, Weifen
pp. 327-332
|
*
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Tian, Zhongjun
; Ng, C.T.
; Cheng, T.C.E.
pp. 368-374
|
*
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Tamir, Arie
pp. 303-306
|
*
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Tamir, Arie
pp. 303-306
|
*
Instability of FIFO in a simple queueing system with arbitrarily low loads
Tezcan, Tolga
pp. 312-316
|
*
Covering skew-supermodular functions by hypergraphs of minimum total size
Bernáth, Attila
; Király, Tamás
pp. 345-350
|
*
Bias optimality for multichain continuous-time Markov decision processes
Guo, Xianping
; Song, XinYuan
; Zhang, Junyu
pp. 317-321
|
*
Asymptotic optimality of the static frequency caching in the presence of correlated requests
Jelenkovic, Predrag R.
; Ana
; Radovanovic, Ana
pp. 307-311
|
*
An inventory system with two suppliers and default risk
Yan, Xiaoming
; Liu, Ke
pp. 322-326
|
*
An improved Benders decomposition applied to a multi-layer network design problem
Fortz, B.
; Poss, M.
pp. 359-364
|
*
A superclass of Edge-Path-Tree graphs with few cliques
Apollonio, Nicola
; Caramia, Massimiliano
pp. 351-355
|
*
A short note on the weighted sub-partition mean of integers
Szabó, Peter
pp. 356-358
|
*
A powerful route minimization heuristic for the vehicle routing problem with time windows
Nagata, Yuichi
; Bräysy, Olli
pp. 333-338
|
*
A note on the subadditive network design problem
Bateni, M.
; Hajiaghayi, M.
pp. 339-344
|
|
