This PR adds an implementation of Kadane's Algorithm, an efficient dynamic programming approach to solve the Maximum Subarray Sum problem in O(n) time. Initializes current and global maximum values.
We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...
Institute of Logistics Science and Engineering of Shanghai Maritime University, Pudong, China Introduction: This study addresses the joint scheduling optimization of continuous berths and quay cranes ...
Abstract: In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority ...
Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) problems or, equivalently, ...
\[ \gdef\bias{\mathrm{bias}} \gdef\deg{\mathrm{deg}} \gdef\indeg{\mathrm{indeg}} \gdef\outdeg{\mathrm{outdeg}} \gdef\Snap{\mathrm{Snap}} \gdef\RSnap{\mathrm{RefSnap ...
Multi-objective scheduling problems in workshops are commonly encountered challenges in the increasingly competitive market economy. These scheduling problems require a trade-off among multiple ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback