Results 71 to 80 of about 915,013 (232)
Omega, 1978 Abstract The paper describes a procedure for mixed integer programming that allows branches to be imposed ‘by degrees’, which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be manipulated and restructured. The approach also yields measures of the costs
openaire +1 more source
An exact approach for single machine scheduling with quadratic earliness and tardiness penalties [PDF]
In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose two different lower bounds, as well as a lower bounding procedure that combines these two bounds.
Jorge M. S. Valente
core
Efficient Similarity Point Set Registration by Transformation Decomposition
Sensors, 2020 Point set registration is one of the basic problems in computer vision. When the overlap ratio between point sets is small or the relative transformation is large, local methods cannot guarantee the accuracy.
Chen Wang, Xinrong Chen, Manning Wang
doaj +1 more source
Mappings of finite distortion: compactness of the branch set
, 2018 We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition.
Kauranen, Aapo +2 more
core
A General Framework for Anytime Approximation in Probabilistic Databases [PDF]
, 2018 Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks.
Gatterbauer, Wolfgang +3 more
core +1 more source
APLIKASI ALGORITME BRANCH AND BOUND DALAM MODEL OPTIMISASI ROBUST
E-Jurnal Matematika, 2019 Bali is one of the regions in Indonesia which is famous for its tourism. Vacationing in Bali seems to be a must for every tourist, both domestic and foreign tourists.
LAILATUL RIZKIANA +2 more
doaj +1 more source
MULTIMODAL MICROSCOPY IMAGE ALIGNMENT USING SPATIAL AND SHAPE INFORMATION AND A BRANCH-AND-BOUND ALGORITHM. [PDF]
Proc IEEE Int Conf Acoust Speech Signal Process, 2023 Chen S +5 more
europepmc +1 more source
Jurnal Matematika, 2016 Waste management in the district Kertapati done by the private sector and government. The authorities responsible for waste management is Palembang City Sanitation Department (DKKP).
Eka Susanti +2 more
doaj +1 more source
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function. [PDF]
Front Robot AI, 2022 Champagne Gareau J +2 more
europepmc +1 more source
Upper bounds of differential branch number of $$n$$ n -bit permutations
CybersecurityThe differential branch number is a key parameter used to measure the diffusion ability of a permutation. It is of great significance to study the upper bound of the differential branch number of permutations. This paper analyses the existence problem of
Ying Gao, Lin Qi
doaj +1 more source