In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polyndoi:10.1007/978-3-319-45587-7_37Dimitri Watel...
You are given a matrixaaof sizen×mn×mconsisting of integers. You can chooseno more than⌊m2⌋⌊m2⌋elements ineach row. Your task is to choose these elements in such a way that their sum isdivisible bykkand this sum is themaximum. ...
The matrix nearness problem considered in this paper is to find a matrix X in the set S at which max { | | } reaches its minimum value. In order to solve the matrix nearness problem, the problem is reformulated to a min-max problem firstly, then the relationship between the min-max ...
Thus, the maximum L-index value from all load buses is selected as the objective function to be minimized as the following equation: 𝑓4(𝑥,𝑢)=max(𝐿𝑗)f4(x,u)=maxLj (10) where f4 is the maximum L-index value of all load buses; and Lj can be computed by (7). 2.2....
The main component in RL is called agent, which takes actions to obtain maximum cumulative reward through interactions with the environment like a human being. Since the fast computation and ability to cope with dynamic events of RL [15], RL has achieved outstanding success in solving DJSSP. ...
1614 G - A/B Matrix GNU C++17 (64) constructive algorithms greedy math *1900 May/24/2020 20:20 1613 F - Spy-string GNU C++17 (64) bitmasks brute force constructive algorithms dp hashing strings *1700 May/24/2020 20:07 1612 E - Polygon GNU C++17 (64) dp graphs implementation shorte...
Nurses have a start and end location (typically their home location), a time window in which they are available to work, and a regular and maximum working time. It is assumed that nurses are paid for their regular working time regardless of the amount of work they do. Working overtime is...
1699B-AlmostTernaryMatrix.cpp 1700B-PalindromicNumbers.cpp 1701A-GrassField.cpp 1701B-Permutation.cpp 1702A-RoundDownThePrice.cpp 1702B-PolycarpWritesAStringFromMemory.cpp 1702C-TrainAndQueries.cpp 1702D-NotACheapString.cpp 1703A-YESorYES.cpp 1703B-ICPCBalloons.cpp 1703C-Cypher.cpp 1703D-Double...
A matrix algorithm is designed to solve maximum independent set problem (MIS), where all independent sets are found by doing detecting operation and all maximum independent sets are figured out by doing electrophoresis operation. In order to reduce the amount of calculation, two methods are used:...
The thrust of this paper is to define 'nearest' in the sense of the least maximum norm (LMN) of the deviation matrix (R-Q), and to obtain R nearest to Q. The LMN provides the overall minimum range of deviation of the elements of R from those of Q. We also append a computer ...