Results 31 to 40 of about 16,265 (145)
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
HCsnip: An R Package for Semi-Supervised Snipping of the Hierarchical Clustering Tree
Cancer Informatics, 2015 Hierarchical clustering (HC) is one of the most frequently used methods in computational biology in the analysis of high-dimensional genomics data.
Askar Obulkasim, Mark A. Van De Wiel
doaj +1 more source
The rank pricing problem: Models and branch-and-cut algorithms
Computers & Operations Research, 2019 One of the main concerns in management and economic planning is to sell the right product to the right customer for the right price. Companies in retail and manufacturing employ pricing strategies to maximize their revenues. The Rank Pricing Problem considers a unit-demand model with unlimited supply and uniform budgets in which customers have a rank ...
Herminia I. Calvete +4 more
openaire +8 more sources
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
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
Smart Agricultural TechnologyThis study investigates optimal routing with a road network to minimize the total traveling distance among scattered farm fields for smart agriculture.
Takuma Nemoto +2 more
doaj +1 more source
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
European Journal of Operational Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Furini F. +3 more
openaire +6 more sources
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation [PDF]
Networks, 2009 AbstractIn this article, the first approach for solving the vertex‐biconnectivity augmentation problem (V2AUG) to optimality is proposed. Given a spanning subgraph of an edge‐weighted graph, we search for the cheapest subset of edges to augment this subgraph to make it vertex‐biconnected.
openaire +1 more source
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem [PDF]
Transportation Science, 2018 This paper considers the Multidepot Rural Postman Problem, an extension of the classical Rural Postman Problem in which there are several depots instead of only one. The aim is to construct a minimum cost set of routes traversing each required edge of the graph, where each route starts and ends at the same depot.
Fernández Aréizaga, Elena +2 more
openaire +3 more sources
IEEE AccessThe depletion of fossil fuel reserves and the urgent need to cut greenhouse gas emissions are driving a significant shift in the global energy sector.
Parisa Mohammadi +3 more
doaj +1 more source