Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 9
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
-
- Published online by Cambridge University Press:
- 08 November 2012, pp. 305-334
-
- Article
- Export citation
- Cited by 9
The triangles method to build X-trees from incomplete distance matrices
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 283-300
-
- Article
- Export citation
- Cited by 9
Redinv-SA: la simulated annealing for the quadratic assignment problem
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 249-273
-
- Article
- Export citation
- Cited by 9
Block decomposition approach to compute a minimum geodetic set∗∗∗
-
- Published online by Cambridge University Press:
- 10 June 2014, pp. 497-507
-
- Article
- Export citation
- Cited by 9
Time–dependent Simple Temporal Networks: Properties and Algorithms∗
-
- Published online by Cambridge University Press:
- 18 April 2013, pp. 173-198
-
- Article
- Export citation
- Cited by 9
Transforming stochastic matrices for stochastic comparison with the st-order
-
- Published online by Cambridge University Press:
- 15 November 2003, pp. 85-97
-
- Article
- Export citation
- Cited by 9
On the minimum cost multiple-source unsplittable flow problem
-
- Published online by Cambridge University Press:
- 21 August 2007, pp. 253-273
-
- Article
- Export citation
- Cited by 9
The partial inverse minimum cut problem with L1-norm is strongly NP-hard
-
- Published online by Cambridge University Press:
- 25 October 2010, pp. 241-249
-
- Article
- Export citation
- Cited by 9
Decomposition of large-scale stochastic optimal control problems
-
- Published online by Cambridge University Press:
- 23 July 2010, pp. 167-183
-
- Article
- Export citation
- Cited by 9
On the Steiner 2-edge connected subgraph polytope
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 259-283
-
- Article
- Export citation
- Cited by 9
État de l'art des méthodes “d'optimisation globale”
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 329-365
-
- Article
- Export citation
- Cited by 9
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
-
- Published online by Cambridge University Press:
- 07 March 2014, pp. 235-254
-
- Article
- Export citation
- Cited by 9
Optimal control and performance analysis of an MX/M/1 queue with batches of negative customers
-
- Published online by Cambridge University Press:
- 15 April 2004, pp. 121-151
-
- Article
- Export citation
- Cited by 9
Approximation algorithms for the design of SDH/SONET networks
-
- Published online by Cambridge University Press:
- 15 March 2004, pp. 235-247
-
- Article
- Export citation
- Cited by 8
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
-
- Published online by Cambridge University Press:
- 15 December 2004, pp. 319-344
-
- Article
- Export citation
- Cited by 8
A new formulation for scheduling unrelated processor under precedence constraints
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 87-92
-
- Article
- Export citation
- Cited by 8
Scheduling multiprocessor tasks on two parallel processors
-
- Published online by Cambridge University Press:
- 15 July 2002, pp. 37-51
-
- Article
- Export citation
- Cited by 8
An analysis of supply chain decisions with asymmetrical retailers : effects of disruptions and static service cost on coordination mechanism
-
- Published online by Cambridge University Press:
- 23 August 2012, pp. 159-187
-
- Article
- Export citation
- Cited by 8
Algorithms for the two dimensional bin packing problem with partial conflicts
-
- Published online by Cambridge University Press:
- 24 May 2012, pp. 41-62
-
- Article
- Export citation
- Cited by 8
Kernel-function Based Algorithms for Semidefinite Optimization
-
- Published online by Cambridge University Press:
- 28 April 2009, pp. 189-199
-
- Article
- Export citation