LAUSR

About LAUSR
Donate
Contact Us

Follow us:

You are not signed in:

Sign Up!


   Articles with "branch bound" as a keyword



Photo from wikipedia

A new branch-and-bound approach to semi-supervised support vector machine

Sign Up to like & get
recommendations! Published in 2017 at "Soft Computing"

DOI: 10.1007/s00500-016-2089-y

Abstract: This paper develops a branch-and-bound algorithm to solve the 2-norm soft margin semi-supervised support vector machine. First, the original problem is reformulated as a non-convex quadratically constrained quadratic programming problem with a simple structure. Then,… read more here.

Keywords: support vector; semi supervised; supervised support; vector machine ... See more keywords
Photo by theblowup from unsplash

Development of automatic nesting system for shipbuilding using the branch-and-bound method

Sign Up to like & get
recommendations! Published in 2019 at "Journal of Marine Science and Technology"

DOI: 10.1007/s00773-018-0559-x

Abstract: This study develops a novel automatic nesting system for shipbuilding using the branch-and-bound method. The previous studies mainly discussed strip-packing problem, which is related to the arrangement of parts on the base material. In addition… read more here.

Keywords: nesting; bound method; problem; branch bound ... See more keywords
Photo by xandager from unsplash

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation

Sign Up to like & get
recommendations! Published in 2018 at "Journal of Global Optimization"

DOI: 10.1007/s10898-018-0620-7

Abstract: In Speakman and Lee (Math Oper Res 42(4):1230–1253, 2017), we analytically developed the idea of using volume as a measure for comparing relaxations in the context of spatial branch-and-bound. Specifically, for trilinear monomials, we analytically… read more here.

Keywords: trilinear monomials; spatial branch; hull relaxation; branching point ... See more keywords
Photo by geraninmo from unsplash

Nonlinear biobjective optimization: improvements to interval branch & bound algorithms

Sign Up to like & get
recommendations! Published in 2019 at "Journal of Global Optimization"

DOI: 10.1007/s10898-019-00768-z

Abstract: Interval based solvers are commonly used for solving single-objective nonlinear optimization problems. Their reliability and increasing performance make them useful when proofs of infeasibility and/or certification of solutions are a must. On the other hand,… read more here.

Keywords: optimization; branch bound; interval branch; biobjective optimization ... See more keywords
Photo from wikipedia

A Branch–Bound Cut Technique for Non-linear Fractional Multi-objective Optimization Problems

Sign Up to like & get
recommendations! Published in 2020 at "International Journal of Applied and Computational Mathematics"

DOI: 10.1007/s40819-020-0771-3

Abstract: This article establishes a branch–bound technique to solve nonlinear convex–convex fractional multi-objective optimization problem in the non-convex feasible region. As far as the authors are concerned, this kind of problem is not solved by any… read more here.

Keywords: multi objective; non linear; linear fractional; optimization ... See more keywords
Photo by benjaminzanatta from unsplash

Can a Branch and Bound algorithm solve all instances of SALBP-1 efficiently?

Sign Up to like & get
recommendations! Published in 2019 at "IFAC-PapersOnLine"

DOI: 10.1016/j.ifacol.2019.11.630

Abstract: Abstract Following the publication by Sewell and Jacobson of a Branch and Bound algorithm which has solved all existing benchmarks for the simple assembly line balancing problem of type 1 (SALBP-1) in less than 1… read more here.

Keywords: bound algorithm; algorithm solve; solve instances; problem ... See more keywords
Photo by geraninmo from unsplash

Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times

Sign Up to like & get
recommendations! Published in 2019 at "International Journal of Production Research"

DOI: 10.1080/00207543.2018.1489156

Abstract: This article proposes hybrid branch and bound algorithms to minimise the makespan for the two-stage assembly scheduling problem with separated setup times. In the studied problem, there are multiple machines at the first stage, each… read more here.

Keywords: bound algorithms; hybrid branch; two stage; stage ... See more keywords
Photo from wikipedia

A branch-and-bound method for the bi-objective simple line assembly balancing problem

Sign Up to like & get
recommendations! Published in 2019 at "International Journal of Production Research"

DOI: 10.1080/00207543.2018.1539266

Abstract: The design of a production system is a strategic level decision. One of the key problems to solve is the line balancing problem that determines the efficiency of a production or assembly line. This class… read more here.

Keywords: line; bound method; balancing problem; problem ... See more keywords
Photo by julienlphoto from unsplash

Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server

Sign Up to like & get
recommendations! Published in 2019 at "Journal of the Operational Research Society"

DOI: 10.1080/01605682.2018.1500976

Abstract: Abstract In this paper, we consider the scheduling problem of minimising the total weighted job completion time when a set of jobs must be processed on m parallel machines with a single server. This problem… read more here.

Keywords: scheduling problem; bound; single server; problem ... See more keywords
Photo by carlheyerdahl from unsplash

A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times

Sign Up to like & get
recommendations! Published in 2017 at "Cogent Engineering"

DOI: 10.1080/23311916.2017.1389638

Abstract: Abstract This work addresses the minimization of the makespan criterion for the permutation flow shop problem with blocking, sequence and machine dependent setup times, which is a problem that has not been studied in previous… read more here.

Keywords: setup times; flow shop; time; permutation flow ... See more keywords
Photo by afgprogrammer from unsplash

A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models

Sign Up to like & get
recommendations! Published in 2022 at "IEEE Access"

DOI: 10.1109/access.2022.3166153

Abstract: The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems. On the other hand, when the traditional BB structure is directly used to solve nonconvex… read more here.

Keywords: nonlinear programming; problem; algorithm; mixed integer ... See more keywords