作者：
Kruglov, Vladislav E.Malyshev, Dmitry S.Pochinka, Olga V.HSE Campus in Nizhny Novgorod
Faculty of Informatics Mathematics and Computer Science Laboratory of Topological Methods in Dynamics. Trainee Researcher Lobachevsky State University of Nizhny Novgorod Institute ITMM Department of Mathematical Physics Optimal Control Master’s HSE Campus in Nizhny Novgorod
Laboratory of Algorithms and Technologies for Networks Analysis. Leading Research Fellow HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Department of Applied Mathematics and Informatics Lobachevsky State University of Nizhny Novgorod Institute ITMM Department of Algebra Geometry and Discrete Mathematics HSE Campus in Nizhny Novgorod
Faculty of Informatics Mathematics and Computer Science Department of Fundamental Mathematics Department Head. HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Laboratory for Topological Methods in Dynamics. Laboratory
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of t...
详细信息
We give characterization of the graphs, whose each induced subgraph has the property: the maximum number of induced 4-paths is equal to the minimum cardinality of the set of vertices such as every induced 4-path conta...
详细信息
In recent years there have been a number of important improvements in exact color-based maximum clique solvers, which have considerably enhanced their performance. Initial vertex ordering is one strategy known to have...
详细信息
The paper presents the description of the modification of the stock market graph model. Authors suggest a new similarity measure between stocks. Following the market graph model a vertex represents a stock. For each p...
详细信息
In this paper we suggest a multi-start greedy heuristic for a real-life truck and trailer routing problem. The considered problem is a site dependent heterogeneous fleet truck and trailer routing problem with soft and...
详细信息
In this paper we suggest a multi-start greedy heuristic for a real-life truck and trailer routing problem. The considered problem is a site dependent heterogeneous fleet truck and trailer routing problem with soft and hard time windows and split deliveries. This problem arises in delivering goods from a warehouse to stores of a big retail company. There are about 400 stores and 100 vehicles for one warehouse. Our heuristic is based on sequential greedy insertion of a customer to a route with further improvement of the solution. The computational experiments are performed for real-life data. We also provide a mixed integer linear programming formulation for precise and clear description of the problem.
Multicast routing systems have the objective of simultaneously transferring data to multiple destination nodes while using a single "push" operation. This leads to cost savings associated with reduced bandwi...
详细信息
The notion of a metric modular on an arbitrary set and the corresponding modular spaces, generalizing classical modulars over linear spaces and Orlicz spaces, were recently introduced and studied by the author [Chisty...
详细信息
暂无评论