Results 1 to 10 of about 41,581 (262)

Influencing Factors of Cutting Force for Apple Tree Branch Pruning

open access: yesAgriculture (Switzerland), 2022
Apple, which occupies the first position in the world with regard to its yield, is an important economic crop in China. Pruning of apple trees is still dominated by manual pruning, resulting in high labor costs and low efficiency. Additionally, there are
Chengjun Li   +3 more
exaly   +3 more sources

An abstract model for branch and cut

open access: yesMathematical Programming, 2022
Branch and cut is the dominant paradigm for solving a wide range of mathematical programming problems -- linear or nonlinear -- combining efficient search (via branch and bound) and relaxation-tightening procedures (via cutting planes, or cuts).
Aleksandr M. Kazachkov   +2 more
openaire   +3 more sources

Branch cuts in maple 17 [PDF]

open access: yesACM Communications in Computer Algebra, 2014
Accurate and comprehensible knowledge about the position of branch cuts is essential for correctly working with multi-valued functions, such as the square root and logarithm. We discuss the new tools in Maple 17 for calculating and visualising the branch cuts of such functions, and others built up from them.
Matthew England 0001   +4 more
openaire   +3 more sources

Energy Consumption during Cutting Tree Branches of Fig (Ficus carica) [PDF]

open access: yesJournal of Soil Sciences and Agricultural Engineering, 2019
This study evaluated energy consumption for cutting tree branches of the fig in different moisture contents (MC) levels at 10, 16, 20 and 25 % w.b., branch diameter levels at 0.5, 1, 1.5 and 2 cm, two types of cutting knives, smooth & serrated and ...
علاء عونى, أحمد الشال
doaj   +1 more source

On the Power and Limitations of Branch and Cut

open access: yesCoRR, 2021
The Stabbing Planes proof system was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formulas -- certain unsatisfiable systems of linear equations mod 2 -- which are canonical hard examples for many algebraic proof
Noah Fleming   +6 more
openaire   +7 more sources

Detecting symmetries by branch & cut [PDF]

open access: yesMathematical Programming, 2002
We present a new approach for detecting automorphisms and symmetries of an arbitrary graph based on branch & cut. We derive an IP-model for this problem and have a first look on cutting planes and primal heuristics. The algorithm was implemented within the ABACUS framework; its experimental runtimes are promising.
Christoph Buchheim, Michael Jünger
openaire   +1 more source

Study on the Dynamic Cutting Mechanism of Green Pepper (Zanthoxylum armatum) Branches under Optimal Tool Parameters

open access: yesAgriculture, 2022
In order to design a branch-cutting type green pepper harvesting device, we firstly study the whole process of straight knife green pepper cutting to reveal the cutting mechanism and provide theoretical guidance to the design.
Yexin Li   +6 more
doaj   +1 more source

Response of Brazilian spinach (Alternanthera sissoo) to propagation planting material and NPK fertilizer application

open access: yesPesquisa Agropecuária Tropical, 2022
Alternanthera sissoo is currently propagated using stem or terminal cuttings, since it does not produce fertile seeds. This research aimed to identify the most effective propagation planting material among rooted stump, stem cutting and terminal cutting,
Strayker Ali Muda   +3 more
doaj   +1 more source

Understanding Branch Cuts of Expressions [PDF]

open access: yes, 2013
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse trigonometric functions.
Matthew England 0001   +3 more
openaire   +2 more sources

BDDs in a Branch and Cut Framework [PDF]

open access: yes, 2005
Branch & Cut is today's state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1-IPs and thus allow for early pruning of parts of the search tree.
Bernd Becker 0001   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy