Results 41 to 50 of about 915,013 (232)

IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES

Barekeng
Many people are interested in cookies. Due to the high consumer interest in cookies, many companies produce cookies with various variants, one of which is Rizky Bakery.
Nira Nityasa Saranta, Susi Setiawani, Rafiantika Megahnia Prihandini, Antonius CahyaPrihandoko, Edy Wihardjo   +4 more
doaj   +1 more source

Branch and bound with simplicial partitions for global optimization

Mathematical Modelling and Analysis, 2008
Branch and bound methods for global optimization are considered in this paper. Advantages and disadvantages of simplicial partitions for branch and bound are shown.
Julius Žilinskas
doaj   +1 more source

On improvements of multi-objective branch and bound

EURO Journal on Computational Optimization
Branch and bound methods which are based on the principle “divide and conquer” are a well established solution approach in single-objective integer programming.
Julius Bauß, Sophie N. Parragh, Michael Stiglmayr   +2 more
doaj   +1 more source

5d Higgs Branch Localization, Seiberg-Witten Equations and Contact Geometry

, 2015
In this paper we apply the idea of Higgs branch localization to 5d supersymmetric theories of vector multiplet and hypermultiplets, obtained as the rigid limit of $\mathcal{N} = 1$ supergravity with all auxiliary fields.
Pan, Yiwen
core   +1 more source

Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times

IEEE Access, 2018
This paper addresses the two centers hybrid flow shop scheduling problem with transportation times. This problem is faced in several real-world applications. The considered objective function to be minimized in this problem is the maximum completion time.
Lotfi Hidri, Sabeur Elkosantini, Mohammed M. Mabkhot   +2 more
doaj   +1 more source

A branch and bound and simulated annealing approach for job shop scheduling [PDF]

, 2004
This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In
Salim, Sutinah, Tan, Hui Woon
core  

An interval-matrix branch-and-bound algorithm for bounding eigenvalues [PDF]

, 2016
We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix.
Adjiman, CSJ, Nerantzis, D
core   +1 more source

Template realization of generalized branch and bound algorithm

Mathematical Modelling and Analysis, 2005
In this work we consider a template for implementation of parallel branch and bound algorithms. The main aim of this package to ease implementation of covering and combinatorial optimization methods for global optimization.
M. Baravykaite, R. Čiegis, J. Žilinskas   +2 more
doaj   +1 more source

Computational Protein Design Using AND/OR Branch-and-Bound Search

, 2015
The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design.
Wu, Yuexin, Zeng, Jianyang, Zhou, Yichao
core   +1 more source

Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

Al-Mustansiriyah Journal of Science, 2022
The present article proposes an exact algorithm for the single-machine scheduling problem to minimize the sum of total completion times, range of lateness and maximum tardiness on a single machine (1/ /(∑ C_(σ_j + R_L + T_max)), where machine idle time ...
Manal Ghassan Ahmed, Faez Hassan Ali
doaj   +1 more source