Search Results - subject:"Cutting plane algorithm"

Optimal berth allocation and time-invariant quay crane assignment in container terminals

Türkoğulları, Yavuz B.; Taşkın, Z. Caner; Aras, Necati - In: European Journal of Operational Research 235 (2014) 1, pp. 88-101

case this condition is not satisfied, we make use of a cutting plane algorithm which solves BACAP repeatedly by adding cuts …

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

Optimal berth allocation and time-invariant quay crane assignment in container terminals

Türkoğullariı, Yavuz B.; Taşkın, Z. Caner; Aras, Necati - In: European journal of operational research : EJOR 235 (2014) 1, pp. 88-101

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

Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs

AKBALIK, Ayse; POCHET, Yves - Center for Operations Research and Econometrics (CORE), … - 2007

cutting plane algorithm is proposed to use these three classes of VI’s in a Branch&Cut procedure. A polynomial time separation …

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

Solving two-stage robust optimization problems using a column-and-constraint generation method

Zeng, Bo; Zhao, Long - In: Operations research letters 41 (2013) 5, pp. 457-461

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

Liner ship route schedule design with sea contingency time and port time uncertainty

Wang, Shuaian; Meng, Qiang - In: Transportation Research Part B: Methodological 46 (2012) 5, pp. 615-633

This paper deals with a tactical-level liner ship route schedule design problem which aims to determine the arrival time of a ship at each portcall on a ship route and the sailing speed function on each voyage leg by taking into account time uncertainties at sea and at port. It first derives the...

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

A computational study of exact knapsack separation for the generalized assignment problem

Avella, Pasquale; Boccia, Maurizio; Vasilyev, Igor - In: Computational Optimization and Applications 45 (2010) 3, pp. 543-555

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

Estimation of failure probability using semi-definite logit model

Konno, Hiroshi; Kawadai, Naoya; Wu, Dai - In: Computational Management Science 1 (2003) 1, pp. 59-73

maximized using a cutting plane algorithm developed for nonlinear semi-definite programming problems. We will show that we can …

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

Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm

Gotoh, Jun-ya; Konno, Hiroshi - In: Management Science 48 (2002) 5, pp. 665-678

newly developed cutting plane algorithm when n is less than six or seven. …

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