In 2 experiments, dark-cutting (DC) beef strip loins were used to test the effects of citric acid-enhancement pH on visual and instrumental color of fresh and cooked steaks. In Exp. 1 and 2, each DC (mean pH = 6.57 and 6.65, respectively) and normal-pH, low USDA Choice (CH; mean pH = 5.48 and 5.51, respectively) strip loin was cut into 2 equal-length sections, and DC sections were injected to 1...

Let G be a minimal imperfect P 5-free graph (i.e. a minimal imperfect graph not containing a path on 5 vertices as induced subgraph) and let S be a minimal cutset of G. In this paper we study several properties of such cutsets, in particular we prove that the subgraph induced by S is connected, contains a P 4 , cannot induce a bipartite subgraph of G .... As a by-product we also give a structur...

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy which we refer to as cut-and-solve and prove optimality and termination for this method. This search is different from traditional tree search as there is no branching. At each node in the search path, a relaxed probl...

Effects of exogenously applied methyl jasmonate (MeJA) and sucrose on vase life and non-structural carbohydrate concentration in petals and leaves of cut ‘First Red’ roses were investigated. Roses were placed in sealed plastic containers and received MeJA vapour treatment (0.1 μL MeJA L-1) for 24 h at 20°C. Flowers were then placed in individual bottles containing 0 or 2% (v/v) sucrose solution...

Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast execu...

In this study, a generalized fuzzy linear programming (GFLP)method is developed for dealing with uncertainties expressed as fuzzy sets. The feasibility of fuzzy solutions of theGFLPproblem is investigated. A stepwise interactive algorithm (SIA) based on the idea of design of experiment is then advanced to solve the GFLP problem. This SIA method was implemented through (i) discretizing membershi...

First, we give an estimable lower bound expression in terms of certain vector fields for the fundamental tone of a bounded domain in a Riemannian manifold (Theorem 2.5). This result can be view as an extension of a theorem of Barta. Second, we relate this Barta's theorem to restrictions to the existence of solutions of certain quasilinear equations (Remark 2.2, Theorem 2.7 and Theorem 2.9). Thi...

This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization....

Motivated by applications from computer network security and software engineering, we study the problem of reducing reachability on a graph with unknown edge costs. When the costs are known, reachability reduction can be solved using a linear relaxation of sparsest cut. Problems arise, however, when edge costs are unknown. In this case, blindly applying sparsest cut with incorrect edge costs ca...

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of findin...