Country: Netherlands

Found 18376 papers in total
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
1989,
An O(n) time algorithm for the projection of a vector is presented on the simplex of...
A new algorithm to find all vertices of a polytope
A new algorithm to find all vertices of a polytope
1989,
This paper presents a new algorithm to find all the vertices of a polytope using a...
A comparison of two interactive MCDM procedures
A comparison of two interactive MCDM procedures
1989,
A number of interactive procedures exists for multiple criteria decision making...
Interactive decision making in fuzzy linear optimization problems
Interactive decision making in fuzzy linear optimization problems
1989,
This paper presents an interactive method for solving a (multi-criteria) linear...
Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
1989,
An algorithm is developed to generate an approximate representation of the noninferior...
Linear programming brings marital bliss
Linear programming brings marital bliss
1989,
A stable matching is an assignment of n men to n women so that no two people prefer...
On simultaneous approximation in quadratic integer programming
On simultaneous approximation in quadratic integer programming
1989,
It is shown how to replace the objective function of an integer quadratic programming...
On the heterogeneous machine interference problem with priority and ordinary machines
On the heterogeneous machine interference problem with priority and ordinary machines
1989,
This paper deals with a heterogeneous machine interference model under the assumption...
Optimality of the shortest line discipline with state-dependent service rates
Optimality of the shortest line discipline with state-dependent service rates
1989,
In this paper, the shortest line discipline, also known as the join the shortest queue...
A note on the Pivot and Complement heuristic for 0-1 programming problems
A note on the Pivot and Complement heuristic for 0-1 programming problems
1989,
When solving large scale integer and mixed integer programming problems it is very...
A probabilistic heuristic for a computational difficult set covering problem
A probabilistic heuristic for a computational difficult set covering problem
1989,
An efficient probabilistic set covering heuristic is presented. The heuristic is...
A note on the traveling salesman problem
A note on the traveling salesman problem
1989,
The paper observes that (i) the problem of recognizing instances of the traveling...
The linear multiple choice knapsack problem
The linear multiple choice knapsack problem
1989,
The multiple choice knapsack problem is defined as a knapsack problem with additional...
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
1989,
Computational results are presented for a parallel branch and bound algorithm that...
The convergence property of sample derivatives in closed Jackson queuing networks
The convergence property of sample derivatives in closed Jackson queuing networks
1989,
A stochastic system such as a queuing network can be specified by system parameters...
On the facial structure of the set covering polytope
On the facial structure of the set covering polytope
1989,
Given a bipartite graph G=(V,U,E), a cover of G is a subset D⊆V with the property...
A LCFS finite buffer model with batch input and non-exponential services
A LCFS finite buffer model with batch input and non-exponential services
1989,
A finite last-come first-served queueing system is studied with batch input and...
A probabilistic analysis of the switching algorithm for the Euclidean TSP
A probabilistic analysis of the switching algorithm for the Euclidean TSP
1989,
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean...
Valid inequalities and facets of the capacitated plant location problem
Valid inequalities and facets of the capacitated plant location problem
1989,
Recently, several successful applications of strong cutting plane methods to...
Device utilizations in approximate MVA
Device utilizations in approximate MVA
1989,
Using a specific form of the estimate for queueing delays at FCFS servers, it is shown...
Heterogeneous-server loss systems with ordered entry: An anomaly
Heterogeneous-server loss systems with ordered entry: An anomaly
1989,
The authors consider a loss system with Poisson arrivals and ordered entry, and they...
Some comments on ‘Resource allocation in a large decentralized enterprise’
Some comments on ‘Resource allocation in a large decentralized enterprise’
1989,
In a recent article Gazi has proposed a method for decentralized decision making in an...
Computational behavior of a feasible direction method for linear programming
Computational behavior of a feasible direction method for linear programming
1989,
The authors discuss a finite method of feasible directions for linear programs. The...
A randomized algorithm for fixed-dimensional linear programming
A randomized algorithm for fixed-dimensional linear programming
1989,
The authors give a (Las Vegas) randomized algorithm for linear programming in a fixed...
Papers per page: