|
|
|
|
|
Sofriesilero Zumaytis,Oscar Karnalim
Pág. 8 - 15
Abstract?According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth Firs...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhiqiang Niu, Shengnan Wu and Xuesong (Simon) Zhou
Focusing on the dynamic improvement of the underlying service network configuration, this paper aims to address a specific challenge of redesigning a multi-echelon city logistics distribution network. By considering the intra-echelon connection of facili...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hazem M. Bahig and Yasser Kotb
A minimal length addition chain for a positive integer m is a finite sequence of positive integers such that (1) the first and last elements in the sequence are 1 and m, respectively, (2) any element greater than 1 in the sequence is the addition of two ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mauricio Granada Echeverri, Ramón Alfonso Gallego Rendón, Ricardo Alberto Hincapié Isaza
Pág. 44 - 50
AbstractDownloadsReferencesHow to Cite
|
|
|
|
|
|
|
|
|
|
|
Felipe Borreiro Sanches, Mauricio Iwama Takano, Marcelo Seido Nagano (Author)
Pág. 321 - 326
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kaan Yilmaz and Neil Yorke-Smith
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming (MIP) branch-and-bound tree by using a learned policy. Previous...
ver más
|
|
|
|
|
|
|
|
|
|
|
Slim Belhaiza
When several Nash equilibria exist in the game, decision-makers need to refine their choices based on some refinement concepts. To this aim, the notion of a ??
?
-proper equilibria set for polymatrix games is used to develop 0?1 mixed linear programs and...
ver más
|
|
|
|
|
|
|
|
|
|
|
Syed Inayatullah, Wajiha Riaz, Hafsa Athar Jafree, Tanveer Ahmed Siddiqi, Muhammad Imtiaz, Saba Naz, Syed Ahmad Hassan
Pág. Page:1 - 6Abstract
|
|
|
|
|
|
|
|
|
|
|
Felipe Borreiro Sanches, Mauricio Iwama Takano, Marcelo Seido Nagano
Pág. 321 - 326
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Anastasia Nichiporchuk,Marina Trenina,Mikhail Abramyan
Pág. 1 - 8
In discrete optimization problems, we apply algorithms based on extensions of the branch and bound method. These extensions consist in the joint work of several auxiliary heuristic algorithms, they can be referred to different, independent from each othe...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Marina Trenina
Pág. 1 - 13
In this paper, we continue to consider one of the tasks of biocybernetics, i.e. the problem of reconstructing the distance matrix between DNA sequences. In this problem, not all the elements of the matrix under consideration are known ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mikhail Abramyan,Boris Melnikov
Pág. 1 - 7
We consider the problem of state minimization of nondeterministic finite automata. One of the ways to solve it is to analyze a subset of the set of states of two canonical automa-ta constructed on the basis of the initial nondeterministic finite automato...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mikhail Abramyan,Boris Melnikov
Pág. 1 - 9
We continue to study heuristics that can be applied to solve the problem of minimizing the states of nondeterministic finite automata by the branch and bound method, or rather, to the implementation of the most difficult stage of the solution associated ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo, Joshua Chukwuere and Trust Tawanda
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 int...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jason Deane, Anurag Agarwal
The multi-dimensional knapsack problem (MDKP) is a well-studied problem in Decision Sciences. The problems NP-Hard nature prevents the successful application of exact procedures such as branch and bound, implicit enumeration and dynamic programming for l...
ver más
|
|
|
|
|
|
|
|
|
|
|
Feihu Zhang, Diandian Xu and Chensheng Cheng
Multi-vehicle collaborative mapping proves more efficient in constructing maps in unfamiliar underwater environments in comparison to single-vehicle methods. One of the pivotal hurdles of Simultaneous Localization and Mapping (SLAM) with multiple underwa...
ver más
|
|
|
|
|
|