Search Results - subject:"branch and bound"

Parallel branch and bound for multidimensional scaling with city-block distances

Žilinskas, Julius - In: Journal of Global Optimization 54 (2012) 2, pp. 261-274

-differentiability. Recently a branch and bound algorithm for multidimensional scaling with city-block distances has been proposed for solution of … parallel version of the branch and bound algorithm for multidimensional scaling with city-block distances has been proposed and …

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

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

expected to be tardy. In addition, a branch and bound algorithm is used to efficiently compute tighter lower bounds for the …

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

A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies

Kuno, Takahito; Buckland, Paul - In: Journal of Global Optimization 52 (2012) 3, pp. 371-390

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

A supply chain design problem with facility location and bi-objective transportation choices

Olivares-Benitez, Elias; González-Velarde, José; … - In: TOP: An Official Journal of the Spanish Society of … 20 (2012) 3, pp. 729-753

A supply chain design problem based on a two-echelon single-product system is addressed. The product is distributed from plants to distribution centers and then to customers. There are several transportation channels available for each pair of facilities between echelons. These transportation...

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

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

HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM

ZHANG, BIN; CHEN, BO - In: Asia-Pacific Journal of Operational Research (APJOR) 29 (2012) 05, pp. 1250031-1

develop an efficient heuristic and propose search and branching rules to improve the branch and bound method for solving exact … solution. Numerical study is done for showing the effectiveness of the proposed heuristic and the modified branch and bound …

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

The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach

Zhang, Zizhen; Qin, Hu; Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 220 (2012) 2, pp. 295-304

into account. To solve this problem exactly, we provide a branch-and-bound algorithm with a provably valid lower bound …

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

Column generation based heuristics for a generalized location routing problem with profits arising in space exploration

Ahn, Jaemyung; de Weck, Olivier; Geng, Yue; Klabjan, Diego - In: European Journal of Operational Research 223 (2012) 1, pp. 47-59

The generalized location routing problem with profits is a new routing problem class that combines the vehicle routing problem with profits, depot or base selection, and the notion of strategies and route tactics to be employed at selected bases. The problem simultaneously determines base...

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

A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems

Hifi, Mhand; Saadi, Toufik - In: Computational Optimization and Applications 51 (2012) 2, pp. 783-807

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

Capital rationing problems under uncertainty and risk

Beraldi, Patrizia; Bruni, Maria; Violi, Antonio - In: Computational Optimization and Applications 51 (2012) 3, pp. 1375-1396

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