Search
Now showing items 1-6 of 6
An Algorithm for Finding the Generalized Nucleolus of a Finite Set and the Multiobjective Discrete Programming Problems
(University of Texas at Arlington, 1982-03)
**Please note that the full text is embargoed**
Generalized Gradient Methods for Solving Locally Lipschitz Feasibility Problems
(University of Texas at Arlington, 1990-12)
**Please note that the full text is embargoed** ABSTRACT: In this paper we study the behavior of a class of iterative
algorithms for solving feasibility problems, that is finite
systems of inequalities [see pdf for ...
Programs and Data Sets for Quasimolecular Modeling of Cavity Flow
(University of Texas at Arlington, 1987-01)
**Please note that the full text is embargoed**
Pressure Method for the Numerical Solution of Transient, Compressible Fluid Flown
(University of Texas at Arlington, 1983-08)
**Please note that the full text is embargoed** ABSTRACT: In this paper the pressure method for incompressible fluid flow simulation is extended and applied to the numerical simulation of compressible fluid
flow. The ...
Continuous Deformation of a Developable Surface
(University of Texas at Arlington, 1996-02)
**Please note that the full text is embargoed** ABSTRACT: A developable surface can be developed from a piece of planar region, or vice versa. Several methods are known to construct an isometric mapping between the developable ...
Greedy and Optimal Paths in a Weighted Graph Without Circuits and Applications to a Class of Optimization Problems on Finite Posets
(University of Texas at Arlington, 1983-05)
**Please note that the full text is embargoed** ABSTRACT: In several recent papers B. Korte and L. Lovasz considered a mathematical structure called a simple language on which a greedy algorithm can operate (see [31,J41, ...