Results 61 to 70 of about 915,013 (232)
An ellipsoidal branch and bound algorithm for global optimization
A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses.
Hager, William, Phan, Dzung
core +1 more source
Processor load balancing for parallel branch and bound algorithms
In this atricle the development of parallel branch and bound algorithm template is presented. Attention is ocused on the dynamic load balancing module of the template.
Milda Baravykaitė
doaj +3 more sources
A Review on Multi-Objective Mixed-Integer Non-Linear Optimization Programming Methods
This paper provides a recent overview of the exact, approximate, and hybrid optimization methods that handle Multi-Objective Mixed-Integer Non-Linear Programming (MO-MINLP) problems.
Ahmed Jaber +3 more
doaj +1 more source
A Branch-and-Bound-Based Algorithm for Nonconvex Multiobjective Optimization
A new branch--and--bound-based algorithm for smooth nonconvex multiobjective optimization problems with convex constraints is presented.
Julia Niebling, Gabriele Eichfelder
semanticscholar +1 more source
Setiap pelaku usaha atau pelaku ekonomi pasti melakukan prinsip ekonomi yaitu dengan usaha atau modal yang sedikit mampu menghasilkan keuntungan yang banyak, sehingga menyebabkan munculnya masalah optimasi.
Elfira Safitri +2 more
doaj +1 more source
Isomorph-Free Branch and Bound Search for Finite State Controllers [PDF]
The recent proliferation of smart-phones and other wearable devices has lead to a surge of new mobile applications. Partially observable Markov decision processes provide a natural framework to design applications that continuously make decisions ...
Grzes, Marek +2 more
core
Performance analysis of Branch-and-Bound skeletons
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorta, I., León, C., Rodríguez, C.
openaire +2 more sources
Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound
Scheduling is the process of organizing, selecting and timing of the use of existing resources to produce output as expected within the expected time too.
Nunung Indra Lesmana
doaj +1 more source
Greedy Graph Colouring is a Misleading Heuristic [PDF]
State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and ...
McCreesh, Ciaran, Prosser, Patrick
core
Resonance States and Quantum Tunneling of Bose Einstein condensates in a 3D shallow trap
A correlated quantum many-body method is applied to describe resonance states of atomic Bose-Einstein condensates (BEC) in a realistic shallow trap (as opposed to infinite traps commonly used).
Chakrabarti, Barnali +2 more
core +1 more source

