Search Results - subject:"branch and bound"

An exact algorithm for the multiple-choice multidimensional knapsack problem.

Hifi, Mhand; Sadfi, Slim; Sbihi, Abdelkader - Maison des Sciences Économiques, Université Paris 1 … - 2004

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle of the approach is twofold : (i) to generate an initial solution, and (ii) at different levels of the tree search to determine a new upper bound used with a...

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

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Pastor, Rafael; Corominas, Albert - In: TOP: An Official Journal of the Spanish Society of … 12 (2004) 1, pp. 169-191

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

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Fisher, Marshall L. - In: Management Science 50 (2004) 12_supplement, pp. 1861-1871

programming relaxation to provide bounds in a branch and bound algorithm. This approach has led to dramatically improved …

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

Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances

Kolisch, Rainer; Sprecher, Arno; Drexl, Andreas - 1992

benchmarked by using the state of the art (branch-and-bound-) procedures. The strong impact of the chosen parametric …

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

Characterization and generation of a general class of resource-constrained project scheduling problems : easy and hard instances

Kolisch, Rainer; Sprecher, Arno; Drexl, Andreas - 1992

benchmarked by using the state of the art (branch-and-bound-) procedures. The strong impact of the chosen parametric …

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

Project scheduling with inventory constraints

Neumann, Klaus; Schwindt, Christoph - In: Computational Statistics 56 (2003) 3, pp. 513-533

efficient branch-and-bound algorithm which enumerates alternatives to avoid stock shortage and surplus by introducing precedence …

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

Project scheduling with inventory constraints

Neumann, Klaus; Schwindt, Christoph - In: Mathematical Methods of Operations Research 56 (2003) 3, pp. 513-533

efficient branch-and-bound algorithm which enumerates alternatives to avoid stock shortage and surplus by introducing precedence …

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

A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices

Brusco, Michael - In: Psychometrika 67 (2002) 3, pp. 459-471

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

A branch and bound algorithm for computing the best subset regression models

Gatu, Cristian; Kontoghiorghes, Erricos - Society for Computational Economics - SCE - 2002

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

Scheduling of project networks by job assignment

Drexl, Andreas - 1990

costs. For solving this time-resource-cost-tradeoff problem we present a hybrid branch and bound / dynamic programming …

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