Results 1 to 10 of about 16,245 (125)
Automatic Detection and Recognition of Citrus Fruit & Leaves Diseases for Precision Agriculture [PDF]
Machine learning is a branch of computer science concerned with developing algorithms & models capable of ‘learning through data and iterations’.
Ashok Kumar Saini +2 more
doaj +3 more sources
Solving Linear Integer Models with Variable Bounding
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal ...
Elias Munapo +2 more
doaj +1 more source
The study focuses on the strategic decisions including on the location and capacity of stations and the fleet size for designing the one-way station-based carsharing systems. Under demand uncertainty, we introduce a two-stage risk-averse stochastic model
Kai Zhang +3 more
doaj +1 more source
Branch and price for submodular bin packing
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular.
Liding Xu +3 more
doaj +1 more source
A branch‐and‐cut algorithm for partition coloring [PDF]
AbstractLet G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1,…,Qq} is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the partition. The partition coloring problem (PCP) consists of finding a subset V′ of V with exactly one vertex from each component Q1,…,Qq and such that ...
Frota, Yuri +3 more
openaire +1 more source
Fast and accurate object detector for autonomous driving based on improved YOLOv5
Autonomous driving is an important branch of artificial intelligence, and real-time and accurate object detection is key to ensuring the safe and stable operation of autonomous vehicles.
Xiang Jia +5 more
doaj +1 more source
Solving the Traveling Salesman Problem with release dates via branch and cut
In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over ...
Agustín Montero +2 more
doaj +1 more source
A Branch-and-Cut Algorithm for Submodular Interdiction Games
Many relevant applications from diverse areas such as marketing, wildlife conservation, and defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function.
Kübra Tanınmış, Markus Sinnl
openaire +2 more sources
Two-stage Memetic Algorithm for Collaborative Decision Making of Emergency Resources Distribution [PDF]
Aiming at the influence of secondary disasters on resource distribution in emergency rescue,this paper proposes an algorithm for collaborative decision making of emergency resources distribution.Firstly,it takes minimizing the time to complete the ...
LIU Jie,ZHAO Lei
doaj +1 more source
The tourist trip design problem (TTDP) helps the trip planners, such as tourists, tour companies, and government agencies, automate their trip planning. TTDP solver chooses and sequences an optimal subset of point of interest (POIs), which adhere to the ...
Supoj Choachaicharoenkul +2 more
doaj +1 more source

