Found 97029 papers in total
An approach to fuzzy goal programming
1989,
In business and non-business organizations, there are many management decision problems where decision...
On the merits and demerits of integer goal programming
1989,
In a recent paper, it was suggested that the use of integer goal programming is questionable. No...
Determining restrictive goals in linear goal program
1989,
Goal programming is a method for solving problems having multiple, conflicting objectives. Information on...
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 important to find good...
A probabilistic heuristic for a computational difficult set covering problem
1989,
An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically...
A note on the traveling salesman problem
1989,
The paper observes that (i) the problem of recognizing instances of the traveling salesman problem for...
The linear multiple choice knapsack problem
1989,
The multiple choice knapsack problem is defined as a knapsack problem with additional mutually exclusive...
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 optimally solves the...
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 that each node...
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 Travelling Salesman...
Valid inequalities and facets of the capacitated plant location problem
1989,
Recently, several successful applications of strong cutting plane methods to combinatorial optimization...
Bard-type methods for the linear complementarity problem with symmetric positive definite matrices
1988,
In this paper, the authors develop two heuristic Block Bard-type methods for solving linear...
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 enterprise...
Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
1989,
The original example of Avis and Chvátal is shown to provide exponential behaviour for certain...
Computational behavior of a feasible direction method for linear programming
1989,
The authors discuss a finite method of feasible directions for linear programs. The method begins with a...
A randomized algorithm for fixed-dimensional linear programming
1989,
The authors give a (Las Vegas) randomized algorithm for linear programming in a fixed dimension d for...
Probing through the intersection of hyperplanes
1989,
A variant of probe is suggested, by which, using a point infeasible to a linear programming solution...
Minmax linear programmes with grouped variables
1989,
The authors consider an optimization problem in which Max[ c j x j ,1•i•p;j∈S i ] is to be...
The tolerance approach to sensitivity analysis of matrix coefficients in linear programming
1989,
The tolerance approach to sensitivity analysis allows for simultaneous and independent variations of the...
Evaluating marginal costs associated with ratio and other constraints in linear programmes
1989,
In certain applications of linear programming, such as blending problems, there are constraints which...
An extension of the simplex algorithm for semi-infinite linear programming
1989,
The authors present a primal method for the solution of the semi-infinite linear programming problem with...
An implementation of Karmarkar’s algorithm for linear programming
1989,
This paper describes the implementation of power series dual affine scaling variants of Karmarkar’s...
Lagrangian dual ascent by generalized linear programming
1989,
In this paper, generalized linear progamming (GLP) is treated as a generator of feasible directions for...
Efficient algorithm for additive and multiplicative models in data envelopment analysis
1989,
An efficient algorithm is proposed for the additive and multiplicative models in data envelopment analysis...
Papers per page:

Paper Filter