Search Results - subject:"Branch and bound algorithm"

A reliable affine relaxation method for global optimization

Ninin, Jordan; Messine, Frédéric; Hansen, Pierre - In: 4OR : a quarterly journal of operations research 13 (2015) 3, pp. 247-277

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

Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Yang, Lixing; Zhou, Xuesong - In: Transportation Research Part B: Methodological 59 (2014) C, pp. 22-44

Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths. We explicitly consider the non-anticipativity constraint associated with the a priori path...

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

Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times

Lei, Weidong; Che, Ada; Chu, Chengbin - In: European Journal of Industrial Engineering 8 (2014) 2, pp. 143-167

This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types … algorithm based on the properties of the developed model. The proposed branch-and-bound algorithm consists of three nested … sequencing issues: part input sequencing and robot move sequencing. We give a formulation for the problem and propose a branch-and-bound …

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

Speeding up branch and bound algorithms for solving the maximum clique problem

Maslov, Evgeny; Batsyn, Mikhail; Pardalos, Panos - In: Journal of Global Optimization 59 (2014) 1, pp. 1-21

high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we …

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

First order rejection tests for multiple-objective optimization

Goldsztejn, Alexandre; Domes, Ferenc; Chevalier, Brice - In: Journal of Global Optimization 58 (2014) 4, pp. 653-672

Three rejection tests for multi-objective optimization problems based on first order optimality conditions are proposed. These tests can certify that a box does not contain any local minimizer, and thus it can be excluded from the search process. They generalize previously proposed rejection...

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

Uncertain constrained optimization by interval-oriented algorithm

Karmakar, Samiran; Bhunia, Asoke Kumar - In: Journal of the Operational Research Society : OR 65 (2014) 1, pp. 73-87

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

Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance

Yan, Pengyu; Che, Ada; Cai, Xiaoqiang; Tang, Xiaowo - In: Computers & operations research : and their … 50 (2014), pp. 128-140

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

Global maximization of UTA functions in multi-objective optimization

Nguyen, Duy Van - In: European Journal of Operational Research 228 (2013) 2, pp. 397-404

The UTAs (UTilité Additives) type methods for constructing nondecreasing additive utility functions were first proposed by Jacquet-Lagrèze and Siskos in 1982 for handling decision problems of multicriteria ranking. In this article, by UTA functions, we mean functions which are constructed by...

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

MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

WANG, JI-BO; WANG, MING-ZHENG - In: Asia-Pacific Journal of Operational Research (APJOR) 30 (2013) 06, pp. 1350022-1

general case. Computational experiments for the branch-and-bound algorithm and heuristic algorithm are presented. …

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

Two-machine flow shop scheduling of polyurethane foam production

Lin, Bertrand M.T.; Lin, Y.-Y.; Fang, K.-T. - In: International Journal of Production Economics 141 (2013) 1, pp. 286-294

time. The studied problem is strongly NP-hard. In this paper, we propose a branch-and-bound algorithm incorporating a lower …

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