Results 41 to 50 of about 28,771 (269)
Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence [PDF]
MATEC Web of Conferences, 2019 The number of online market places for freight matching is on the rise. Online market places help small trucking companies find shipping customers. However, they do not provide cargo consolidation strategies.
Krishnan Devaraj R., Liu Tieming
doaj +1 more source
Rethinking plastic waste: innovations in enzymatic breakdown of oil‐based polyesters and bioplastics
FEBS Open Bio, EarlyView.Plastic pollution remains a critical environmental challenge, and current mechanical and chemical recycling methods are insufficient to achieve a fully circular economy. This review highlights recent breakthroughs in the enzymatic depolymerization of both oil‐derived polyesters and bioplastics, including high‐throughput protein engineering, de novo ...
Elena Rosini +2 more
wiley +1 more source
Branch-and-Cut Algorithms for Colorful Components Problems
INFORMS Journal on ComputingWe tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one.
Claudia Archetti +2 more
openaire +2 more sources
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem
EURO Journal on Transportation and LogisticsIn the Multi-Commodity two-echelon Distribution Problem (MC2DP), multiple commodities are distributed in a two-echelon distribution system involving suppliers, distribution centres and customers.
Matteo Petris +4 more
doaj +1 more source
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Journal of Applied Mathematics, 2018 The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear programming
Elizabeth L. Bouzarth +6 more
doaj +1 more source
Digital twins to accelerate target identification and drug development for immune‐mediated disorders
FEBS Open Bio, EarlyView.Digital twins integrate patient‐derived molecular and clinical data into personalised computational models that simulate disease mechanisms. They enable rapid identification and validation of therapeutic targets, prediction of drug responses, and prioritisation of candidate interventions.
Anna Niarakis, Philippe Moingeon
wiley +1 more source
Branch-and-cut algorithms for the covering salesman problem
RAIRO - Operations Research, 2023 The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum length Hamiltonian cycle over a subset of vertices that covers an undirected graph.
Lucas Porto Maziero +2 more
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Peripheral neuropathies contribute to patient disability but may be diagnosed late or missed altogether due to late referral, limitation of current diagnostic methods and lack of specialized testing facilities. To address this clinical gap, we developed NeuropathAI, an interpretable deep learning–based multiclass classification ...
Chaima Ben Rabah +7 more
wiley +1 more source
Comparison of Optimisation Techniques for the Electric Vehicle Scheduling Problem
Smart CitiesThe Electric Vehicle Scheduling Problem (E-VSP) addresses the challenge of efficiently assigning predetermined trips to an electric vehicle fleet while accounting for charging infrastructure and battery range constraints.
Jacques Wüst +2 more
doaj +1 more source