Search Results - subject:"branch and bound"

Mathematical formulations for the parallel machine scheduling problem with a single server

Elidrissi, Abdelhak; Benmansour, Rachid; Benbrahim, Mohammed - In: International journal of production research 59 (2021) 20, pp. 6166-6184

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

Cover by disjoint cliques cuts for the knapsack problem with conflicting items

Luiz, Thiago Alcântara; Santos, Haroldo Gambini; … - In: Operations research letters 49 (2021) 6, pp. 844-850

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

The robust machine availability problem

Song, G.; Kowalczyk, D.; Leus, Roel - 2017

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

Globally optimal univariate spline approximations

Mohr, Robert; Coblenz, Maximilian; Kirst, Peter - In: Computational Optimization and Applications 85 (2023) 2, pp. 409-439

method that we propose is a branch-and-bound algorithm tailored specifically to the combinatorial formulation. We compare our …

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

A branch-and-prune algorithm for discrete Nash equilibrium problems

Schwarze, Stefan; Stein, Oliver - In: Computational Optimization and Applications 86 (2023) 2, pp. 491-519

We present a branch-and-prune procedure for discrete Nash equilibrium problems with a convex description of each player's strategy set. The derived pruning criterion does not require player convexity, but only strict convexity of some player's objective function in a single variable. If...

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

A massively parallel exact solution algorithm for the balanced minimum evolution problem

Catanzaro, Daniele; Frohn, Martin; Gascuel, Olivier; … - 2023

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

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Pferschy, Ulrich; Resch, Julia; Righini, Giovanni - In: Journal of scheduling : JOS 26 (2023) 3, pp. 267-287

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

Ranking decomposition for the discrete ordered median problem

Cherkesly, Marilène; Contardo, Claudio; Gruson, Matthieu - 2023

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

A Novel Branch-and-Bound Algorithm for the Chance-Constrained RCPSP

Davari, Morteza - 2016

deal with uncertainty in the RCPSP. In this paper, we propose a branch-and-bound (B&B) algorithm and a MILP formulation … be solved. The computational results suggest that the proposed branch-and-bound procedure clearly outperforms both a …

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

Branch-and-Bound Algorithms for Assortment Optimization Under Weakly Rational Choice

Pixton, Clark - 2016

. We give a mixed-integer linear optimization formulation with an exponential number of constraints, and present two branch-and-bound …

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