Results 211 to 220 of about 978 (247)
Some of the next articles are maybe not open access.
The Prospects for Export of Primal Beef Cuts to California*
Canadian Journal of Agricultural Economics/Revue canadienne d'agroeconomie, 1985The west coast of the United States has been suggested as a large potential market for Alberta beef products. The paper presents a formal investigation of this market for primal beef cuts. Three aspects are covered; the compatability of Canadian and United States grading and cutting specifications, the profitability of such exports using historical ...
K. G. Gillis +4 more
openaire +1 more source
A primal‐dual cutting‐plane algorithm for all‐integer programming
Naval Research Logistics Quarterly, 1981AbstractThe integer programming literature contains many algorithms for solving all‐integer programming problems but, in general, existing algorithms are less than satisfactory even in solving problems of modest size. In this paper we present a new technique for solving the all‐integer, integer programming problem.
Ghandforoush, Parviz, Austin, Larry M.
openaire +1 more source
Integral Simplex Using Decomposition with Primal Cuts
2014The integral simplex using decomposition (ISUD) algorithm [22] is a dynamic constraint reduction method that aims to solve the popular set partitioning problem (SPP). It is a special case of primal algorithms, i.e. algorithms that furnish an improving sequence of feasible solutions based on the resolution, at each iteration, of an augmentation problem ...
Samuel Rosat +3 more
openaire +2 more sources
A Primal-Dual Algorithm for Weighted Abstract Cut Packing
2011Hoffman and Schwartz [13] developed the Lattice Polyhedron model and proved that it is totally dual integral (TDI), and so has integral optimal solutions.Themodel generalizesmany important combinatorial optimization problems such as polymatroid intersection, cut covering polyhedra, min cost aborescences, etc., but has lacked a combinatorial algorithm ...
S. Thomas McCormick, Britta Peis
openaire +1 more source
Immersion chilling of hot cut, vacuum packed pork primals
Meat Science, 1988Hot-cutting and immersion chilling of pork was compared with a conventional air chilling process. The right sides of eight pig carcasses were cut into primals whilst hot, vacuum packed and chilled in sodium chloride brine at 0°C, whilst the left sides were chilled conventionally in air at 0°C and 1 m/s, before being similarly cut and vacuum packed. The
T, Brown +4 more
openaire +2 more sources
Genetic parameters for quality attributes in individual pork primal cuts
Meat ScienceHeritabilites, genetic and phenotypic correlations were estimated for carcass and primal cut quality traits in 1118 commercial crossbred pigs (498 females and 620 males). A total of 22 traits, including loin, shoulder, ham and belly traits, were evaluated.
Z, Mozduri +5 more
openaire +2 more sources
Prediction of pork belly fatness from the intact primal cut
Food Control, 2010Abstract Research was successfully undertaken to identify one or more non-invasive measuring sites on the primal belly which would predict belly fatness as well as or better than backfat depth at the grading site. Crossbred market weight gilts ( n = 297) were slaughtered, dressed, graded, chilled and fabricated into primals according to commercial ...
B. Uttaro, S. Zawadski
openaire +1 more source
Warm start of the primal-dual method applied in the cutting-plane scheme
Mathematical Programming, 1998A practical warm-start procedure is described for the infeasible primal-dual interior-point method (IPM) employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this field, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow ...
openaire +2 more sources
Image classification of pork primal cuts using an enhanced efficientnet architecture
Fifth International Conference on Computer Vision and Data Mining (ICCVDM 2024)exaly +2 more sources
Accelerated primal-dual cutting plane algorithm for all-integer programming
Computers & Operations Research, 1983Abstract The use of integer programming as a modeling technique is widespread in practice, but current algorithms for solving these models are less than satisfactory even for problems of modest size. Thus the search continues for more efficient and reliable algorithms. In this paper we present a technique for solving all-integer programming problems.
openaire +1 more source