首页   按字顺浏览 期刊浏览 卷期浏览 Minimizing a sum of staircase functions under linear constraints
Minimizing a sum of staircase functions under linear constraints

 

作者: C.T. Bornstein,   R. Rust,  

 

期刊: Optimization  （Taylor Available online 1988）
卷期: Volume 19, issue 2  

页码: 181-190

 

ISSN:0233-1934

 

年代: 1988

 

DOI:10.1080/02331938808843335

 

出版商: Akademic-Verlag

 

关键词: Capacitated warehouse location problem;Flows In Networks;Combinatorial Programming;Branch-and-Bound;Primary:90 B 10;Secondary: 90 C 08;Secondary:90 C 27

 

数据来源: Taylor

 

摘要:

We present a branch -and-bound algorithm to minimizef(x) forx∈G∩CwhereGare network flow constraintsis a sum of staircase functions. We minimize the separable staircase functions over a polyhedron making successive linearizations of the objective function. Computational results are presented for the capacitated warehouse location problem.

 

点击下载:  PDF (444KB)



返 回