Found 97029 papers in total
Modelling and optimization of a flexible pipeline assembly system
1990,
In this paper the modelling and optimization of a class of flexible assembly system is considered. The...
Optimal grouping of researchers into departments
1991,
The authors deal with the class of those quadratic semi-assignment problems-in maximization form-in which...
A Lagrangean approach to the facility location problem with concave costs
1991,
The authors consider the concave cost capacitated facility location problem, and develop a composite...
The precedence constrained traveling salesman problem
1991,
The authors consider a generalization of the classical traveling salesman problem (TSP) called the...
Optimization of objective functions in polymatroidal network flows
1991,
Polymatroidal network flows generalize both network flow theory and matroid optimization. This paper sets...
A generator of test quadratic assignment problems with known optimal solution
1988,
Lower estimates are given for integral functions of the quadratic assignment problem. An algorithm for...
Dual simplex method for the assignment problem
1991,
A variant of Balinski’s signature method is presented for the solution of assignment problem. The...
Portfolio Selection: A mixed-integer programming model solved by a Branch and Bound algorithm
1990,
Portfolio Selection can be represented by Markowitz’s continuous model. This model is valid if all...
Conical algorithms for solving a concave programming problem and some generalizations
1988,
Improvements in conical algorithms for solving the general concave programming problem are discussed. A...
Elementary vectors in separable convex programming
1990,
This paper presents an optimization algorithm oriented toward the separable applied convex programming...
On the structure of the conditional εà-subgradient method for simultaneous solution of the direct and dual convex programming problems
1990,
The investigation of the sensitivity of a solution obtained for the convex programming problem to various...
Deterministic and sampling heuristic algorithms for project scheduling with resource constraints
1989,
This paper compares the performance of deterministic and sampling heuristic algorithms for project...
Duality and dynamic programming in the control of simple motion
1989,
Control of simple motion is considered under conditions ensuring successive approach to a given family of...
A modification of the dynamic programming method for the travelling-salesman problem
1989,
A time-optimal control problem is considered for a simple trajectory visiting a given finite system of...
On the concept of an infinite extremal in stationary problems of dynamic optimization
1990,
This note is an analysis of the concept of an infinite extremal in stationary dynamic optimization...
Water resources planning under budgetary uncertainty: The case in Indonesia
1991,
Due to the limitations of existing stochastic programming techniques for handling problems of sequential...
Adapting multi-criteria planning to the Nigerian economy
1991,
Techniques of development planning involve physical and financial aspects. Financial planning refers to...
A method of solving a class of integer programming problems
1989,
A branch-and-bound algorithm is proposed for integer programming problems with an additive nonlinear...
Exact solution of locomotive scheduling problems
1991,
Given a daily repeating timetable and locomotives of various types, each timetabled train must be assigned...
Oil exploration: A property of Beale’s model
1991,
This paper assumes that an oil company has k areas in which to drill and occurrences of undiscovered...
Sufficient working subsets for the tour scheduling problem
1991,
Mathematical programs to schedule service employees at minimum cost represent each feasible schedule, or...
An interior point algorithm to solve computationally difficult set covering problems
1991,
The authors present an interior point approach to the zero-one integer programming feasibility problem...
Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem
1991,
The main difficulty arising in using dynamic programming to solve combinatorial optimization comes from...
Estimate of the rate of convergence of the regularization method for solving the linear programming problem
1989,
The regularization method for a linear programming problem with inexact initial data is considered. The...
Papers per page:

Paper Filter