The following pages link to A. G. Chentsov (Q220269):
Displaying 14 items.
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- To a Question on the Supercompactness of Ultrafilter Spaces (Q5125227) (← links)
- Constraints of asymptotic nature and attainability problems (Q5139120) (← links)
- Relaxation of pursuit-evasion differential game and program absorption operator (Q5139131) (← links)
- Dynamic programming in the generalized bottleneck problem and the start point optimization (Q5224167) (← links)
- Routing of displacements with dynamic constraints: “bottleneck problem” (Q5266472) (← links)
- The programmed iterations method in a game problem of guidance (Q5266488) (← links)
- Some representations of free ultrafilters (Q5266494) (← links)
- The Bellmann insertions in route problems with constraints and complicated cost functions. II (Q5364324) (← links)
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints (Q5871390) (← links)
- Some properties of ultrafilters related to their use as generalized elements (Q6073596) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
- Closed mappings and construction of extension models (Q6154816) (← links)
