The following pages link to P. A. Grossman (Q280979):
Displaying 15 items.
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations (Q280980) (← links)
- Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point (Q280981) (← links)
- Local polynomial functions on semilattices (Q1149972) (← links)
- Combined optimisation of an open-pit mine outline and the transition depth to underground mining (Q1754360) (← links)
- Minimal curvature-constrained networks (Q1756754) (← links)
- Scheduling the construction of value and discount weighted trees for maximum net present value (Q2289887) (← links)
- Maximizing the net present value of a Steiner tree (Q2349527) (← links)
- MINIMAL CURVATURE-CONSTRAINED PATHS IN THE PLANE WITH A CONSTRAINT ON ARCS WITH OPPOSITE ORIENTATIONS (Q3459365) (← links)
- (Q3963070) (← links)
- Polynomial interpolation on universal algebras (Q3966193) (← links)
- Compilation of linear partial differential equations into finite-difference programs (Q4076705) (← links)
- Optimally locating a junction point for an underground mine to maximise the net present value (Q4638394) (← links)
- Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)
- Solving the prize‐collecting Euclidean Steiner tree problem (Q6071078) (← links)
- Curvature-constrained Steiner networks with three terminals (Q6631569) (← links)
