Search Results - subject:"branch and bound"

A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP

LIN, B. M. T.; WU, J. M. - In: Asia-Pacific Journal of Operational Research (APJOR) 22 (2005) 03, pp. 391-407

The purpose of this study is to present a simple lower bound to facilitate the development of branch-and-bound …

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

Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

Brusco, Michael; Stahl, Stephanie - In: Psychometrika 70 (2005) 2, pp. 253-270

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

The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem

Szmerekovsky, Joseph G. - In: Management Science 51 (2005) 4, pp. 629-640

strong sense and a branch-and-bound procedure is provided for its solution. Results are obtained for the new model that …

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

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

Sandholm, Tuomas; Suri, Subhash; Gilpin, Andrew; … - In: Management Science 51 (2005) 3, pp. 374-390

Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is \scr{N}\scr{P}-complete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition...

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