Search Results - subject:"branch and bound algorithms"

Enhancing branch-and-bound for multiobjective 0-1 programming

Forget, Nicolas; Parragh, Sophie N. - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 1, pp. 285-304

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

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty

Chassein, André; Goerigk, Marc; Kurtz, Jannis; Poss, … - In: European journal of operational research : EJOR 279 (2019) 2, pp. 308-319

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

Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal

Lacour, Renaud - Université Paris-Dauphine (Paris IX) - 2014

This thesis deals with several aspects related to solving multi-objective problems, without restriction to the bi-objective case. We consider exact solving, which generates the nondominated set, and approximate solving, which computes an approximation of the nondominated set with a priori...

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

On linear programming relaxations for solving polynomial programming problems

Dalkiran, Evrim; Ghalami, Laleh - In: Computers & operations research : and their … 99 (2018), pp. 67-77

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

Exact approaches for the knapsack problem with setups

Furini, Fabio; Monaci, Michele; Traversi, Emiliano - In: Computers & operations research : and their … 90 (2018), pp. 208-220

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

On rigorous upper bounds to a global optimum

Kearfott, Ralph - In: Journal of Global Optimization 59 (2014) 2, pp. 459-476

In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is …

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

A general framework for convexity analysis in deterministic global optimization

Kearfott, Ralph; Castille, Jessie; Tyagi, Gaurav - In: Journal of Global Optimization 56 (2013) 3, pp. 765-785

and bound algorithms. We proposed a specific algorithm, based on a generated computational graph of the problem, for … identified certain variables as convex, not ever needing subdivision, and non-convex, or possibly needing subdivision in branch …

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

A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

Sewell, Edward; Sauppe, Jason; Morrison, David; … - In: Journal of Global Optimization 54 (2012) 4, pp. 791-812

This paper presents a Branch, Bound, and Remember (BB&R) exact algorithm using the Cyclic Best First Search (CBFS) exploration strategy for solving the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${1|ST_{sd}|\sum T_{i}}$$</EquationSource> </InlineEquation> scheduling problem, a single machine scheduling problem with sequence dependent setup times where the objective is...</equationsource></inlineequation>

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

New dominance rules and exploration strategies for the 1|r <Subscript> i </Subscript>|∑U <Subscript> i </Subscript> scheduling problem

Kao, Gio; Sewell, Edward; Jacobson, Sheldon; Hall, Shane - In: Computational Optimization and Applications 51 (2012) 3, pp. 1253-1274

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

A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop

Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10

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