Algorithmic procedure Clause Samples

An Algorithmic Procedure clause defines a specific, step-by-step process that parties must follow to perform a task or resolve an issue under the agreement. This clause typically outlines the sequence of actions, decision points, and criteria to be used, such as how to calculate a payment adjustment or resolve a technical dispute. By providing a clear and objective method, the clause ensures consistency, reduces ambiguity, and helps prevent disagreements about how certain contractual obligations should be fulfilled.
Algorithmic procedure. The cut insertion procedure of the Combinatorial Benders Algorithm (CBA) is sketched in Figure 2. Commercial solvers enable the user to interrupt the MP branch-and-cut process at various nodes to launch predefined routines for different purposes. In our algorithm, this practical tool is used to launch the SP(αˆ) model whenever the value ZR(αˆ) of a feasible integer solution αˆ is lower than the incumbent value Zinc, as described by Algorithm 1. The solution method for the SP is summarized below by Algorithm 2. MP Explored nodes Tested node SP The addition of the combinatorial cut (17) to the MP formulation excludes candidate αˆ from the feasible space, whether it is optimal for MDPC or not. The branch-and-cut procedure continues searching for the best feasible solution until there are no candidates left. When the solver stops, the optimality criterion is satisfied: the relaxed value ZR(αˆ) of any solution αˆ is above the incumbent value, which is therefore optimal (Zinc = Zopt). The lower bound obtained along the process is associated with the MP formulation. Therefore, it is never larger than the optimal value of the MP, which is itself a lower bound for the MDPC model. The sub-problem SP to be solved by Algorithm 1 is a MILP that must be solved repeatedly and may take a considerable amount of time to solve. In order to facilitate its solution, as suggested in Section 6.2.2, we decompose it per period, and we solve each sub-problem SP(αˆt), for t ∈ T . This process can be further accelerated as follows. For the contract plan αˆ and a period t, consider the assignment αˆt, that is, the restriction of αˆ to period t. It may very well happen (and in fact, it frequently happens in practice) that αˆt = αt for another contract plan α which was considered in Algorithm 1: Single-tree Benders Subroutine (Feasible αˆ )
View Source
Algorithmic procedure. The cut insertion procedure of the Combinatorial Benders Algorithm (CBA) is sketched in Figure 2. As mentioned above, the tree is generated when solving the master problem by branch-and-cut. Com- mercial solvers enable the user to interrupt the MP branch-and-cut process at various nodes to launch predefined routines. In our algorithm, this practical tool is used to solve the SP(αˆ) model whenever the value ZR(αˆ) of a new feasible integer solution αˆ is lower than the incumbent value Zinc, as described by Algorithm 1. The solution method for the SP is summarized below by Algorithm 2. The addition of the combinatorial cut (17) to the MP formulation excludes candidate αˆ from the feasible space, whether it is optimal for MDPC or not. The branch-and-cut procedure continues searching for better feasible solutions, and it may either generate new values for αˆ, or eventually conclude that there is none left. When the solver stops, the optimality criterion is satisfied: the relaxed value ZR(αˆ) of any solution αˆ is above the incumbent value, which is therefore optimal (Zinc = Zopt). The lower bound obtained along the process is associated with the MP formulation. Therefore, it is never larger than the optimal value of the MP, which is itself a lower bound for the MDPC model. Algorithm 1: Single-tree Benders Subroutine (Feasible αˆ )
View Source

Related to Algorithmic procedure

  • Texas Family Code Child Support Certification Pursuant to §231.006, Texas Family Code, Contractor certifies it is not ineligible to receive the award of or payments under this Agreement, and acknowledges this Agreement may be terminated and payment withheld if this certification is inaccurate.

  • Distribution of UDP and TCP queries DNS probes will send UDP or TCP “DNS test” approximating the distribution of these queries.

  • Procedures for Providing NP Through Full NXX Code Migration Where a Party has activated an entire NXX for a single Customer, or activated at least eighty percent (80%) of an NXX for a single Customer, with the remaining numbers in that NXX either reserved for future use by that Customer or otherwise unused, if such Customer chooses to receive Telephone Exchange Service from the other Party, the first Party shall cooperate with the second Party to have the entire NXX reassigned in the LERG (and associated industry databases, routing tables, etc.) to an End Office operated by the second Party. Such transfer will be accomplished with appropriate coordination between the Parties and subject to appropriate industry lead times for movements of NXXs from one switch to another. Neither Party shall charge the other in connection with this coordinated transfer.

  • Random Drug Testing All employees covered by this Agreement shall be subject to random drug testing in accordance with Appendix D.

  • Follow-up Testing An employee shall submit to unscheduled follow-up drug and/or alcohol testing if, within the previous 24-month period, the employee voluntarily disclosed drug or alcohol problems, entered into or completed a rehabilitation program for drug or alcohol abuse, failed or refused a preappointment drug test, or was disciplined for violating the provisions of this Agreement and Employer work rules. The Employer may require an employee who is subject to follow-up testing to submit to no more than six unscheduled drug or alcohol tests within any 12 month period.