Search results
From MaRDI portal
- Type A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON 1995-04-02 Paper...10 bytes (16 words) - 01:41, 28 December 2023
- their rays 2014-11-12 Paper Computing the bounded subcomplex of an unbounded polyhedron 2013-03-12 Paper Trees, tight-spans and point configurations 2012-08-10...10 bytes (16 words) - 05:50, 7 October 2023
- Problems on Unbounded Polyhedra 1994-03-21 Paper A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron 1992-09-27...10 bytes (16 words) - 18:03, 6 October 2023
- Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron 1992-09-27 Paper https://portal.mardi4nfdi.de/entity/Q3354422 1990-01-01...10 bytes (21 words) - 16:14, 9 December 2023
- Paper A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON 1995-04-02 Paper A recursive algorithm for finding the minimum norm...10 bytes (16 words) - 04:12, 25 September 2023
- Trolebús system 2013-03-19 Paper Computing the bounded subcomplex of an unbounded polyhedron 2013-03-12 Paper Models for fare planning in public transport 2012-11-22...10 bytes (18 words) - 14:57, 10 December 2023
- programs 2013-03-18 Paper Computing the bounded subcomplex of an unbounded polyhedron 2013-03-12 Paper Polyhedral and algebraic methods in computational...10 bytes (14 words) - 17:53, 26 December 2023
- de/entity/Q5499288 2015-02-11 Paper Determining the Viable Unbounded Polyhedron Under Linear Control Systems 2015-02-06 Paper Recovering exponential accuracy...10 bytes (17 words) - 20:12, 11 December 2023
- Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron 1992-09-27 Paper A variable dimension algorithm with the Dantzig-Wolfe...10 bytes (16 words) - 17:45, 11 December 2023
- Problems on Unbounded Polyhedra 1994-03-21 Paper A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron 1992-09-27...10 bytes (18 words) - 16:14, 9 December 2023
- mardi4nfdi.de/entity/Q5499442 2015-02-11 Paper Determining the Viable Unbounded Polyhedron Under Linear Control Systems 2015-02-06 Paper Second order sufficient...10 bytes (16 words) - 22:45, 9 December 2023
- https://portal.mardi4nfdi.de/entity/Q5448355 2008-03-20 Paper Monte-Carlo and polyhedron-based simulations. I: Extremal states of the logarithmic \(N\)-body problem...10 bytes (19 words) - 16:08, 13 December 2023
- 2018-10-22 Paper Finite element method to fluid-solid interaction problems with unbounded periodic interfaces 2016-04-29 Paper Scattering of time-harmonic electromagnetic...10 bytes (16 words) - 03:48, 9 December 2023
- fractional functions on quadrilaterals 2004-03-15 Paper Pivoting in an outcome polyhedron 2004-01-27 Paper Global optimization of nonlinear sums of ratios 2003-03-12...10 bytes (18 words) - 15:53, 9 December 2023
- trajectory in a three-dimensional model of a Brusselator 2021-02-11 Paper On Unbounded Limit Sets of Dynamical Systems 2020-10-23 Paper On the Chernous'ko Time-Optimal...10 bytes (18 words) - 16:19, 10 December 2023
- barotropic fluid-rotating sphere system 2008-01-18 Paper Monte-Carlo and polyhedron-based simulations. I: Extremal states of the logarithmic \(N\)-body problem...10 bytes (18 words) - 16:44, 6 December 2023
- hyperbolic quadrature method of moments 2024-01-05 Paper First Moments of a Polyhedron Clipped by a Paraboloid 2023-09-27 Paper An adjoint method for control...10 bytes (16 words) - 08:14, 7 October 2023
- Chords and disjoint paths in matroids 1977-01-01 Paper An unbounded matroid intersection polyhedron 1977-01-01 Paper A network simplex method 1976-01-01 Paper...10 bytes (18 words) - 06:01, 13 December 2023
- combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios 2018-12-17 Paper A minmax regret version of the time-dependent...10 bytes (16 words) - 16:55, 9 December 2023
- 1984-01-01 Paper Unbounded hardware is equivalent to deterministic Turing machines 1983-01-01 Paper A decision procedure for optimal polyhedron partitioning...10 bytes (17 words) - 03:21, 9 December 2023
