Results 161 to 170 of about 8,467 (244)

A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints

Networks, EarlyView.
ABSTRACT This article studies a vehicle routing problem involving a fleet of heavy‐duty vehicles and pickup‐and‐delivery requests for crude items that are both heavy and high‐temperature. The objective is to route the fleet in such a way that maximizes resource efficiency and operational efficiency while simultaneously avoiding thermal overload of any ...
Biljana Roljić, Yuan Chen
wiley   +1 more source

Low-carbon supply chain logistics risk prediction using meta-learning-based graph convolutional network on prototype space. [PDF]

Sci Rep
Wang Y, Sun Y.
europepmc   +1 more source

Perfect Matching Under Precedence Constraints

Networks, EarlyView.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

Optimizing wireless sensor networks using fuzzy triangular snake graph models and fuzzy topological indices. [PDF]

Sci Rep
Hashem AF, Liaqat S, Mufti ZS, Hanif MF.
europepmc   +1 more source

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, EarlyView.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source

Automatic Identification and Visualization of Reaction Mechanisms Contained within Direct Dynamics Simulations. [PDF]

ACS Omega
Kobulnicky T, Boafo E, Barnes GL.
europepmc   +1 more source

Tractable but Hard to Approximate: The Bi‐Objective Minimum s$$ s $$‐t$$ t $$‐Cut Problem With Binary Capacities

Networks, EarlyView.
ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen   +4 more
wiley   +1 more source

Low-energy tetrahedral networks for carbon and silicon from (2+1)-regular bipartite-like graphs. [PDF]

IUCrJ
Wei Y, Li S, Shi X, He C.
europepmc   +1 more source

A amostragem estratificada aprimora a compreensão das redes entre morcegos e frutos na Mata Atlântica meridional

Oikos, EarlyView.
Few studies have sought to understand the vertical patterns of bat–fruit systems, and therefore, it is not possible to evaluate whether interpretations based on data collected from a single stratum adequately represent the interaction patterns of this system. In this context, we evaluated the dissimilarity in the assemblage of frugivorous bats, plants,
Karolaine Porto Supi, Thais Bastos Zanata, Daniela Aparecida Savariz Bôlla, Fernando Carvalho   +3 more
wiley   +1 more source

QSPR graph model to explore physicochemical properties of potential antiviral drugs of dengue disease through novel coloring-based topological indices. [PDF]

Front Chem
Yogalakshmi C, Balamurugan BJ.
europepmc   +1 more source