Search
Search Results
-
Optimization strategies for the bilevel network design problem with affine cost functions
Today artificial intelligence systems support efficient management in different fields of social activities. In particular, congestion control in...
-
Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
The present paper is devoted to the study of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by linear...
-
Column generation for the equilibrium route-flow traffic assignment problem
Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of...
-
Simple Graph Density Inequalities with No Sum of Squares Proofs
Establishing inequalities among graph densities is a central pursuit in extremal combinatorics. A standard tool to certify the nonnegativity of a...
-
Generative well pattern design—principles, implementation, and test on OLYMPUS challenge field development problem
A novel generative (well pattern) design approach is proposed for a reservoir well pattern design, building upon the observation that automated...
-
Coordinated Target Assignment and UAV Path Planning with Timing Constraints
The engagement of a group of autonomous air vehicles against several targets is a major challenge in mission planning. This paper addresses the...
-
Path homotopy invariants and their application to optimal trajectory planning
We consider the problem of optimal path planning in different homotopy classes in a given environment. Though important in robotics applications,...
-
Partially Local Multi-way Alignments
Multiple sequence alignments are an essential tool in bioinformatics and computational biology, where they are used to represent the mutual...
-
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance...
-
The heptagon-wheel cocycle in the Kontsevich graph complex
The real vector space of non-oriented graphs is known to carry a differential graded Lie algebra structure. Cocycles in the Kontsevich graph complex,...
-
On the Maximum Parsimony Distance Between Phylogenetic Trees
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of...
-
Network analysis of Zentralblatt MATH data
We analyze the data about works (papers, books) from the time period 1990–2010 that are collected in Zentralblatt MATH database. The data were...
-
Spectral Characterization of Families of Split Graphs
An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k -regular subgraph...
-
Flow Graphs: Analysis with Near Sets
This paper introduces a framework for flow graphs induced by perceptual systems as well as analysis of such graphs using near set theory. A...
-
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment
This paper introduces a new approach for three-dimensional flight path optimization for unmanned aerial vehicles. It considers the performance of the...
-
Universal Gröbner basis associated with the maximum flow problem
We give a formulation of the maximum flow problem as an integer programming problem in the standard form. We characterize elementary vectors of the...
-
An exact model for cell formation in group technology
Despite the long history of the cell formation problem (CF) and availability of dozens of approaches, very few of them explicitly optimize the...
-
Maximum-weight stable sets and safe lower bounds for graph coloring
The best method known for determining lower bounds on the vertex coloring number of a graph is the linear-programming column-generation technique,...
-
Markov chain-based degree distributions of evolving networks
In this paper, we study a class of stochastic processes, called evolving network Markov chains, in evolving networks. Our approach is to transform...