The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2003, volume: 31, number: 3

  1. Amir Beck, Marc Teboulle
    Mirror descent and nonlinear projected subgradient methods for convex optimization. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:167-175 [Journal]
  2. Satoru Fujishige
    A maximum flow algorithm using MA ordering. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:176-178 [Journal]
  3. Refael Hassin, Shlomi Rubinstein
    Approximation algorithms for the metric maximum clustering problem with given cluster sizes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:179-184 [Journal]
  4. Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
    A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:185-194 [Journal]
  5. Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger
    Local search for the minimum label spanning tree problem with bounded color classes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:195-201 [Journal]
  6. James M. Calvin, Joseph Y.-T. Leung
    Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:202-210 [Journal]
  7. Laureano F. Escudero, Araceli Garín, Gloria Pérez
    An O(n log n) procedure for identifying facets of the knapsack polytope. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:211-218 [Journal]
  8. Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger
    The two-machine open shop problem: To fit or not to fit, that is the question. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:219-224 [Journal]
  9. Sixiang Hou, Han Hoogeveen
    The three-machine proportionate flow shop problem with unequal machine speeds. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:225-231 [Journal]
  10. Xiwen Lu, René Sitters, Leen Stougie
    A class of on-line scheduling algorithms to minimize total completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:232-236 [Journal]
  11. Jeffrey P. Kharoufeh
    Explicit results for wear processes in a Markovian environment. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:237-244 [Journal]
  12. Fred Glover, Hanif D. Sherali
    Foundation-penalty cuts for mixed-integer programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:245-253 [Journal]
  13. Sem C. Borst, Onno J. Boxma, John A. Morrison, R. Núñez Queija
    The equivalence between processor sharing and service in random order. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:254-262 [Journal]
  14. Attahiru Sule Alfa
    Waiting time distribution of the MAP/D/k system in discrete time - a more efficient algorithm. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:263-267 [Journal]
  15. Seung-Min Lee
    On the characterization of continuum structure functions. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:268-272 [Journal]
  16. Michele Conforti, Refael Hassin, R. Ravi
    Reconstructing edge-disjoint paths. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:273-276 [Journal]
  17. Herminia I. Calvete, Lourdes del Pozo
    The quickest path problem with batch constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:277-284 [Journal]
  18. Bahar Yetis Kara, Erhan Erkut, Vedat Verter
    Accurate calculation of hazardous materials transport risks. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:285-292 [Journal]
  19. Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura
    Computing an obnoxious anchored segment. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:293-300 [Journal]
  20. Young-Gun G, Young-Jo Seong, Maing-Kyu Kang
    A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:301-307 [Journal]
  21. Christoph J. Schuster, Jose M. Framinan
    Approximative procedures for no-wait job shop scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:308-318 [Journal]
  22. T. C. Edwin Cheng, Zhaohui Liu
    Approximability of two-machine no-wait flowshop scheduling with availability constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:319-322 [Journal]
  23. C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu
    On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:323-326 [Journal]
  24. Chi Kin Chau, Kwang Mong Sim
    The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:327-334 [Journal]
  25. Geir Dahl, Njål Foldnes
    Complete description of a class of knapsack polytopes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:335-340 [Journal]
  26. Paulo Bárcia, J. Orestes Cerdeira
    Node packings on cocomparability graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:341-342 [Journal]
  27. Matthias Elf, Michael Jünger, Giovanni Rinaldi
    Minimizing breaks by maximizing cuts. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:343-349 [Journal]
  28. Marcus Oswald, Gerhard Reinelt
    The weighted consecutive ones problem for a fixed number of rows or columns. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:350-356 [Journal]
  29. David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich
    Transformations of generalized ATSP into ATSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:357-365 [Journal]
  30. Woonghee Tim Huh, Ganesh Janakiraman, Peter L. Jackson, Nidhi Sawhney
    Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:366-374 [Journal]
  31. Shane G. Henderson
    Estimation for nonhomogeneous Poisson processes from aggregated data. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:375-382 [Journal]
  32. Jacques Resing, Lerzan Örmeci
    A tandem queueing model with coupled processors. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:383-389 [Journal]
  33. Philipp Afèche
    Delay performance in stochastic processing networks with priority service. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:390-400 [Journal]
  34. Nikhil Bansal
    Analysis of the M/G/1 processor-sharing queue with bulk arrivals. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:401-405 [Journal]
  35. Hiroyuki Masuyama, Tetsuya Takine
    Sojourn time distribution in a MAP/M/1 processor-sharing queue. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:406-412 [Journal]
  36. Marc Uetz
    When greediness fails: examples from stochastic scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:413-419 [Journal]
  37. Michael O. Ball, Chien-Yu Chen, Zhen-Ying Zhao
    Material compatibility constraints for make-to-order production planning. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:420-428 [Journal]
  38. Paolo Ventura, Friedrich Eisenbrand
    A compact linear program for testing optimality of perfect matchings. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:429-434 [Journal]
  39. Yann Kieffer
    The facets of the polytope of modules of a graph. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:435-441 [Journal]
  40. Jan Brinkhuis
    On the complexity of the primal self-concordant barrier method. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:442-444 [Journal]
  41. Monica Bianchi, Rita Pini
    A note on stability for parametric equilibrium problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:445-450 [Journal]
  42. David Perry, Wolfgang Stadje
    Duality of dams via mountain processes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:451-458 [Journal]
  43. Yong J. Kim, Michael V. Mannino
    Optimal incentive-compatible pricing for M/G/1 queues. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:459-461 [Journal]
  44. Hans Daduna, Ryszard Szekli
    Dependence structure of sojourn times via partition separated ordering. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:462-472 [Journal]
  45. Mohammed Abbad, Hatim Boustique
    A decomposition algorithm for limiting average Markov decision problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:473-476 [Journal]
  46. Jun Zhang
    Managing multi-customer service level requirements with a simple rationing policy. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:477-482 [Journal]
  47. George L. Vairaktarakis
    On Gilmore-Gomory's open question for the bottleneck TSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:483-491 [Journal]
  48. Yunpeng Pan
    An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:492-496 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002