ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Biology
Medicine / Sub specialtie
Public health
Education
Agronomy and forestry
Technology
Research
Pure sciences
Sports
Food and nutrition
all records (75)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
Ukraine
Poland
Pakistan
Russia
Italy
South Africa
Canada
all records (72)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
27.517  Articles
1 of 2.753 pages  |  10  records  |  more records»
The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers in purpose to satisfy precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objectiv... see more

The completion of gravitational data inversion results in a smooth recovered model. GRAV3D is one software that can be used to solve 3D inversion problems of gravity data. Nevertheless there are still fundamental problems related to how to ensure the vali... see more

This paper aims to develop an optimization approach for deriving the upper and lower bounds of transportation network vulnerability under simultaneous disruptions of multiple links without the need to evaluate all possible combinations as in the enumerati... see more

Although Shannon introduced the concept of a rate distortion function in 1948, only in the last decade has the methodology for developing rate distortion function lower bounds for real-world sources been established. However, these recent results have not... see more

We prove that for all graphs with at most (3.75-o(1))n(3.75-o(1))n edges there exists a 2-coloring of the edges such that every monochromatic path has order less than nn.  This was previously known to be true for graphs with at most 2.5n-7.52.5n-7.5 ... see more

The second smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connectivity and denoted by a(G). We prove thata(G)>p2/3(p(12g(n1, n2, …, np)2 - p2)/4g(n1, n2, …, np)4 + 4(q - p)(3g(np + 1, np + 2, …, nq)2 - p... see more

We prove that for all graphs with at most (3.75-o(1))n(3.75-o(1))n edges there exists a 2-coloring of the edges such that every monochromatic path has order less than nn.  This was previously known to be true for graphs with at most 2.5n-7.52.5n-7.5 ... see more

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let Bn be the number of nonisomorphic arrangements of n pseud... see more

In the military deployment planning problem (DPP), troops and cargoes are transported from source nodes to destination nodes by using multimodal transportation assets, while considering various constraints, such as the supply availability, demand satisfac... see more

1 of 2.753 pages  |  10  records  |  more records»