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 8
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
-
- Published online by Cambridge University Press:
- 11 February 2013, pp. 33-46
-
- Article
- Export citation
- Cited by 8
Minimization of communication expenditure for seasonal products
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 109-127
-
- Article
- Export citation
- Cited by 8
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 8
Metasearch information fusion using linear programming
-
- Published online by Cambridge University Press:
- 08 November 2012, pp. 289-303
-
- Article
- Export citation
- Cited by 8
Entropy maximization and the busy period of some single-server vacation models
-
- Published online by Cambridge University Press:
- 15 September 2004, pp. 195-213
-
- Article
- Export citation
- Cited by 8
Solving the Crop Allocation Problem using Hard and Soft Constraints∗
-
- Published online by Cambridge University Press:
- 18 April 2013, pp. 151-172
-
- Article
- Export citation
- Cited by 8
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
-
- Published online by Cambridge University Press:
- 01 July 2006, pp. 53-73
-
- Article
- Export citation
- Cited by 8
A numerical feasible interior point method for linear semidefinite programs
-
- Published online by Cambridge University Press:
- 15 June 2007, pp. 49-59
-
- Article
- Export citation
- Cited by 8
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
-
- Published online by Cambridge University Press:
- 15 June 2007, pp. 1-18
-
- Article
- Export citation
- Cited by 8
Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
-
- Published online by Cambridge University Press:
- 08 November 2006, pp. 285-302
-
- Article
- Export citation
- Cited by 8
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
-
- Published online by Cambridge University Press:
- 11 January 2011, pp. 323-343
-
- Article
- Export citation
- Cited by 8
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
-
- Published online by Cambridge University Press:
- 08 April 2006, pp. 227-241
-
- Article
- Export citation
- Cited by 8
Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
-
- Published online by Cambridge University Press:
- 20 August 2008, pp. 371-387
-
- Article
- Export citation
- Cited by 7
A DEA model for two-stage parallel-series production processes
-
- Published online by Cambridge University Press:
- 10 January 2014, pp. 123-134
-
- Article
- Export citation
- Cited by 7
Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes
-
- Published online by Cambridge University Press:
- 15 April 2004, pp. 153-171
-
- Article
- Export citation
- Cited by 7
Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
-
- Published online by Cambridge University Press:
- 29 November 2013, pp. 429-443
-
- Article
- Export citation
- Cited by 7
An Extended Opportunity-Based Age Replacement Policy
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 145-154
-
- Article
- Export citation
- Cited by 7
Acyclic Orientations with Path Constraints
-
- Published online by Cambridge University Press:
- 04 April 2009, pp. 455-467
-
- Article
- Export citation
- Cited by 7
Tractable algorithms for chance-constrained combinatorial problems
-
- Published online by Cambridge University Press:
- 28 April 2009, pp. 157-187
-
- Article
- Export citation
- Cited by 7
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
-
- Published online by Cambridge University Press:
- 25 January 2006, pp. 163-183
-
- Article
- Export citation