Keyword: combinatorial analysis

Found 435 papers in total
An approximate solution method for combinatorial optimization. Hybrid approach of genetic algorithm and Lagrange relaxation method
An approximate solution method for combinatorial optimization. Hybrid approach of genetic algorithm and Lagrange relaxation method
1994,
In this paper the authors deal with an efficient method for obtaining a suboptimal...
Asymptotic theory of selection by relative rank with low cost
Asymptotic theory of selection by relative rank with low cost
1993,
Selection from among n objects by relative rank with no recall-the ‘secretary...
Asymptotic theory of selection by relative rank with medium cost
Asymptotic theory of selection by relative rank with medium cost
1993,
Selection from among n objects by relative rank with no recall - the ‘secretary...
Multiple choice programming: A state-of-the-art review
Multiple choice programming: A state-of-the-art review
1994,
Multiple choice programming, originated from Healy Jr, belongs to the non-convex...
Asymptotic theory of selection by relative rank with high cost
Asymptotic theory of selection by relative rank with high cost
1993,
Selection from among n objects by relative rank with no recall - the ‘secretary...
A rigorous computational comparison of alternative solution methods for the generalized assignment problem
A rigorous computational comparison of alternative solution methods for the generalized assignment problem
1994,
Statistical experimental design and analysis is a cornerstone for scientific inquiry...
Scheduling jobs under simple linear deterioration
Scheduling jobs under simple linear deterioration
1994,
The paper considers simple linear deterioration of processing times, i.e. P i =α...
A search-based heuristic for the two-dimensional bin-packing problem
A search-based heuristic for the two-dimensional bin-packing problem
1994,
A heuristic algorithm combining priority rules with a restricted search procedure is...
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
1993,
The authors consider the well-known RAS algorithm for the problem of positive matrix...
Strong regularity of matrices-A survey of results
Strong regularity of matrices-A survey of results
1994,
Let 𝒢=(G,¸ª$,¸•) be a linearly ordered, commutative...
On constructing the elimination tree
On constructing the elimination tree
1994,
The authors present a new algorithm for constructing the elimination tree for the...
An instant solution of the 2×n bottleneck transportation problem
An instant solution of the 2×n bottleneck transportation problem
1993,
This paper provides an instant method to solve the 2× n bottleneck...
A polynomial time algorithm for the guillotine pallet loading problem
A polynomial time algorithm for the guillotine pallet loading problem
1994,
A polynomial time algorithm is presented for solving the two-dimensional guillotine...
On the convergence speed for some iterative methods
On the convergence speed for some iterative methods
1993,
The paper derives two types of iterative methods, each containing two parameters. Then...
Train plan model for British Rail freight services through the Channel Tunnel
Train plan model for British Rail freight services through the Channel Tunnel
1994,
British Rail will operate direct high-speed freight train services between Britain and...
Efficient labelling algorithms for the maximum noncrossing matching problem
Efficient labelling algorithms for the maximum noncrossing matching problem
1993,
Consider a bipartite graph; let’s suppose the origin nodes and the destination...
A greedy heuristic for a minimum-weight forest problem
A greedy heuristic for a minimum-weight forest problem
1993,
Given an undirected edge-weighted graph and a natural number m, the authors consider...
Solving a class of stochastic minimization problems
Solving a class of stochastic minimization problems
1994,
This work gives a methodology for analyzing a class of discrete minimization problems...
Note on combinatorial optimization with max-linear objective functions
Note on combinatorial optimization with max-linear objective functions
1993,
The authors consider combinatorial optimization problems with a feasible solution set...
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Adjacency of the best and second best valued solutions in combinatorial optimization problems
1993,
The authors say that a polytope satisfies the strong adjacency property if every best...
Basic theory of selection by relative rank with cost
Basic theory of selection by relative rank with cost
1993,
Suppose there are n objects in a row and we want to choose as good an object as...
A result of Vapnik with applications
A result of Vapnik with applications
1993,
A new proof of a result due to Vapnik is given. Its implications for the theory of PAC...
A unifying location model on tree graphs based on submodularity properties
A unifying location model on tree graphs based on submodularity properties
1993,
Let ℱ be the collection of nonempty subtrees of a given tree T. Each subtree is...
A fast approximation algorithm for the subset-sum problem
A fast approximation algorithm for the subset-sum problem
1994,
A new fully polynomial approximation scheme for the subset-sum problem is presented....
Papers per page: