scientific article; zbMATH DE number 3324725
From MaRDI portal
Publication:5602916
Cited in
(38)- On an alternative for pursuit-evasion games in an infinite time interval
- On relative nearstandardness in IST
- Hypercomputation by definition
- The stationary translationally invariant Peierls equation in radiative transfer theory in the space of slowly growing distributions, and some properties of the Peierls potential. II
- The Hochschild-Mitchell dimension of linearly ordered sets and the continuum hypothesis
- Differential approach-evasion game: alternative solvability and the construction of relaxations
- To the question on some generalizations of properties of the linkedness of families of sets and the supercompactness of topological spaces
- Precomplete numberings
- On spaces of functional clones
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- Programmed iteration method and sets of positional absorption
- Some topological structures of extensions of abstract reachability problems
- Route problem with constraints depending on a list of tasks
- On an asymptotic analysis problem related to the construction of an attainability domain
- Linear homeomorphisms of spaces of continuous functions on long Sorgenfrey lines
- scientific article; zbMATH DE number 4077207 (Why is no real title available?)
- Manipulation aspect of databases: The composition approach
- Superextension as bitopological space
- Maximal linked systems on families of measurable rectangles
- Maximal linked systems on products of widely understood measurable spaces
- On sequential traversal of sets
- One task of routing jobs in high radiation conditions
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- Yet another kind of rough sets induced by coverings
- Dynamic programming in the routing problem: decomposition variant
- On the question of the optimization of permutations in the problem with dynamic constraints
- On one routing task with the optimization of the start-finish point
- On certain analogues of linkedness and supercompactness
- To the question of optimization of the starting point in the routing problem with restrictions
- The lattice copies of \(\ell_{\infty}(\Gamma)/c_{0}(\Gamma)\) in a quotient of a Banach lattice
- A bottleneck routing problem with a system of priority tasks
- Some questions connected with implementation of attraction sets accurate to a predetermined neighborhood
- Attraction sets in abstract attainability problems and their representations in terms of ultrafilters
- A topological version for the oligomorphicity of groups
- On the existence of a possibility distribution function
- Transfinite sequences in the programmed iteration method
- Construction of limiting process operations using ultrafilters of measurable spaces
- Computing currency invariant indices with an application to minimum variance currency baskets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602916)
