Results 51 to 60 of about 204,066 (330)

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

open access: yesBarekeng
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   +4 more
doaj   +1 more source

Branch and bound with simplicial partitions for global optimization

open access: yesMathematical 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

open access: yesEURO 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ß   +2 more
doaj   +1 more source

Optimal clustering of frequency-constrained maintenance jobs with shared set-ups [PDF]

open access: yes, 1997
Since maintenance jobs often require one or more set-up activities, joint execution or clustering of maintenance jobs is a powerful instrument to reduce shut-down costs.
Dijkhuizen, Gerhard van   +1 more
core   +2 more sources

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

open access: yesIEEE 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   +2 more
doaj   +1 more source

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

open access: yes, 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  

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

open access: yes, 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

A methionine‐lined active site governs carbocation stabilization and product specificity in a bacterial terpene synthase

open access: yesFEBS Letters, EarlyView.
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel   +13 more
wiley   +1 more source

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

Template realization of generalized branch and bound algorithm

open access: yesMathematical 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   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy