Search Results - subject:"branch and bound"

Lee, Jon; Zou, Bai - In: Journal of Global Optimization 60 (2014) 2, pp. 307-315

We describe a branch-and-bound (b&b) method aimed at searching for an exact solution of the fundamental problem of …

Persistent link: https://www.econbiz.de/10010937783

Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming

Melo, Wendel; Fampa, Marcia; Raupp, Fernanda - In: Journal of Global Optimization 60 (2014) 2, pp. 373-389

hybrid algorithm is an improved version of the classical nonlinear branch-and-bound (BB) procedure, where the enhancements …

Persistent link: https://www.econbiz.de/10010937785

Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development

Kleniati, Polyxeni-Margarita; Adjiman, Claire - In: Journal of Global Optimization 60 (2014) 3, pp. 425-458

the outer problems) using a single branch-and-bound tree. A novel branching scheme is developed such that classical branch-and-bound … the inner problem. To achieve this, the well-known features of branch-and-bound algorithms are customized appropriately …

Persistent link: https://www.econbiz.de/10010938212

Fitting concentric circles to measurements

Drezner, Zvi; Brimberg, Jack - In: Mathematical Methods of Operations Research 79 (2014) 1, pp. 119-133

Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a...

Persistent link: https://www.econbiz.de/10010999599

A branch-and-bound algorithm for the coupled task problem

Békési, József; Galambos, Gábor; Jung, Michael; … - In: Mathematical Methods of Operations Research 80 (2014) 1, pp. 47-81

applications and is NP-hard. In this paper we present a branch-and-bound algorithm for this problem and compare its performance …

Persistent link: https://www.econbiz.de/10010999978

A column generation approach for solving the patient admission scheduling problem

Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper - In: European Journal of Operational Research 235 (2014) 1, pp. 252-264

such variant and propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic …

Persistent link: https://www.econbiz.de/10010744206

Bound constrained interval global optimization in the COCONUT Environment

Markót, Mihály; Schichl, Hermann - In: Journal of Global Optimization 60 (2014) 4, pp. 751-776

We introduce a new interval global optimization method for solving bound constrained problems. The method originates from a small standalone software and is implemented in the COCONUT Environment, a framework designed for the development of complex algorithms, containing numerous...

Persistent link: https://www.econbiz.de/10011151236

Column generation bounds for numerical microaggregation

Aloise, Daniel; Hansen, Pierre; Rocha, Caroline; Santi, … - In: Journal of Global Optimization 60 (2014) 2, pp. 165-182

its pricing problem is solved by a specialized branch-and-bound. The algorithm is able to find, for the first time, lower …

Persistent link: https://www.econbiz.de/10010993998

New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains

Thi, Hoai; Tran, Duc - In: Journal of Global Optimization 60 (2014) 1, pp. 5-24

resulting problem. For globally solving this problem, we investigate a combined DCA-Branch and Bound algorithm. DCA is applied … works on a continuous domain, and the combined DCA-Branch and Bound finds an <InlineEquation ID="IEq1"> <EquationSource …

Persistent link: https://www.econbiz.de/10010994020

Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results

Kleniati, Polyxeni-M.; Adjiman, Claire - In: Journal of Global Optimization 60 (2014) 3, pp. 459-481

spaces (corresponding to the inner and the outer problems) using a single branch-and-bound tree, where two pairs of lower and …

Persistent link: https://www.econbiz.de/10010994079