A combinatorial ranking problem.
A combinatorial ranking problem. (Short Communication).
A Complexity Calculus for Recursive Tree Algorithms
A conception of optimality for algorithms and its application to the optimal search for a minimum
A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not...
A heuristical algorithm for simple exponential analysis
A new possibility in bi-directional search
A probabilistic analysis of a new satisfiability algorithm
À propos de l’optimalité des algorithmes numériques : étude du calcul de
A Systematic Approach to the Synthesis of Algorithms.
Algorithm 25. Discrete optimization by the method of Mao and Wallingford
Algorithm 26. Limit distribution of the number of items in the queueing system E₂/E₂/n
Algorithm 27. Statistical prediction by the method of harmonical weights
Algorithm 29. Solving systems of linear equations by Sokolov's method
Algorithm 30. The calculation of the minimum of a certain function of one variable
Algorithm 31. The calculation of the minimum of a certain function of several variables
Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable
Algorithm 35. Calculation of measures of stochastical dependence
Algorithm 37. Solution of sparse linear equation systems
Algorithm 42. Enclosure of a point to the minimum spanning tree