Found 97029 papers in total
An improved direct descent algorithm for binary knapsack problems
1989,
Several efficient algorithms for solution of the binary knapsack problem have appeared in the literature....
Logic-based decision support
1989,
This monograph is directly based on a series of ten lectures, of the same title, given at Rutgers...
An interior point algorithm for semi-infinite linear programming
1989,
The authors consider the generalization of a variant of Karmarkar’s algorithm to semi-infinite...
The worst-case step in Karmarkar’s algorithm
1989,
In this note the worst-case performance in a single step of Karmarkar’s projective algorithm for...
Interior path following primal-dual algorithms, part I: Linear programming
1989,
The authors describe a primal-dual interior point algorithm for linear programming problems which requires...
A modified GUB algorithm for solving linear minimax problems
1989,
This article is concerned with the minimization of the maximal value of a set of linear functions subject...
An analysis of an available set of linear programming test problems
1989,
A set of linear programming test problems is analyzed with MINOS, Version 5.1. The problems have been run...
Stochastic task selection and renewable resource allocation
1989,
In this note, the authors study a class of renewable resource allocation problems for the processing of...
Markov decision processes
1989,
A review is given of an optimization model of discrete-stage, sequential decision making in a stochastic...
Practical polynomial time algorithms for linear complementarity problems
1989,
In this paper the authors first propose three practical algorithms for linear complementarity problems,...
A polynomial-time algorithm for a class of linear complementarity problems
1989,
Given an n × n matrix M and an n -dimensional vector q , the problem of finding n -dimensional...
On strongly degenerate complementary cones and solution rays
1989,
In this paper the authors show that if A is a matrix in the class of matrices E ( d ), for a d ∈ R n...
Identifying nondominated alternatives with partial information for multiple-objective discrete and linear programming problems
1989,
The problem addressed is that of reducing the set of finite (discrete) multiple criteria alternatives to a...
Efficiency and generalized convex duality for multiobjective programs
1989,
The concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective non-linear...
A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
1989,
This paper presents generalized scalarization methods for obtaining Pareto optimal solutions to...
Using weighting vectors to solve multiple attribute problems: A framework
1989,
In this paper a study is made of the use of weighting vectors to generate solutions to problems where the...
Interactive multicriteria linear programming: An extension of the method of Zionts and Wallenius
1989,
This article presents an extension of the interactive multicriteria linear-programming method of Zionts...
A new approach to the maximum-flow problem
1988,
All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path...
As fast parametric maximum flow algorithm and applications
1989,
The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed...
An improved primal simplex variant for pure processing networks
1989,
In processing networks, ordinary network constraints are supplemented by proportional flow restrictions on...
An O(n2(m+nlogn)logn) min-cost flow algorithm
1988,
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a maximum flow of...
An approximation algorithm for the TSP
1989,
The authors present a new polynomial-time heuristic algorithm for finding a solution to the Travelling...
An exact solution method for the MTSP
1989,
A new mathematical model for the multi-travelling salesman problem (MTSP) is presented. The MTSP...
Maximizing classes of two-parameter objectives over matroids
1989,
Let M =( N ,ℱ) be a matroid. Suppose that each element i in N is associated with an ordered pair of...
Papers per page:

Paper Filter