Results 1 to 10 of about 143,487 (265)
Introduction to ABACUS – a branch-and-cut system [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Junger
exaly +3 more sources
A Branch-and-Cut algorithm for graph coloring
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paula Zabala, Isabel Mendez-Diaz
exaly +5 more sources
An abstract model for branch and cut
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
Solving Linear Integer Models with Variable Bounding
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal ...
Elias Munapo +2 more
doaj +1 more source
Parameters of finger stalk lifter cut branches in intensive gardens [PDF]
In Uzbekistan, the areas of intensive orchards are expanding, in which branches are regularly pruned according to agrotechnical rules. In intensive orchards, the number of fruit trees is usually greater, so cut branches occupy most of the row-spacing ...
Shoumarova Muxayyo +4 more
doaj +1 more source
On the Power and Limitations of Branch and Cut
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
The architecture of spray cut chrysanthemum is crucial for the quality and quantity of cut flower production. However, the mechanism underlying plant architecture still needs to be clarified. In this study, we measured nine architecture-related traits of
Daojin Sun +9 more
doaj +1 more source
Branch-and-cut solution approach for multilevel mixed integer linear programming problems
A multilevel programming problem is an optimization problem that involves multiple decision makers, whose decisions are made in a sequential (or hierarchical) order. If all objective functions and constraints are linear and some decision variables in any
Ashenafi Awraris +2 more
doaj +1 more source
This paper presents a hybrid algorithm for solving the Capacitated Vehicle Routing Problem with practical three-dimensional loading constraint. This problem is known as 3L-CVRP (Three-dimensional Loading Capacitated Vehicle Routing Problem).
Luis Miguel Escobar-Falcón +4 more
doaj +3 more sources
A branch‐and‐cut algorithm for partition coloring [PDF]
AbstractLet G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1,…,Qq} is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the partition. The partition coloring problem (PCP) consists of finding a subset V′ of V with exactly one vertex from each component Q1,…,Qq and such that ...
Yuri Frota +3 more
openaire +1 more source

