A multi-commodity flow formulation for the generalized pooling problem
نویسندگان
چکیده
منابع مشابه
New multi-commodity flow formulations for the pooling problem
The pooling problem is a nonconvex nonlinear programming problem with numerous applications. The nonlinearities of the problem arise from bilinear constraints that capture the blending of raw materials. Bilinear constraints are well-studied and significant progress has been made in solving large instances of the pooling problem to global optimality. This is due in no small part to reformulation...
متن کاملA Multi-commodity Pickup and Delivery Open-tour m-TSP Formulation for Bike Sharing Rebalancing Problem
Bike sharing systems (BSSs) offer a mobility service whereby public bikes, located at different stations across an urban area, are available for shared use. An important point is that the distribution of rides between stations is not uniformly distributed and certain stations fill up or empty over time. These empty and full stations lead to demand for bikes and return boxes that cannot be fulfi...
متن کاملA Parallel Algorithm for Nonlinear Multi-commodity Network Flow Problem
In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method on several examples of NMNF problem and obtained...
متن کاملA Multi-commodity Flow Approach to the Crew Rostering Problem
An airline crew rostering problem is a large-scaled and complex optimization problem that assigns crew members to the flight duties while satisfying agreements with the labor union, the government regulations, the carrier’s own policies, and other requirements. The traditional crew rostering problem considers only minimizing the total perdiem in order to reduce the airline expense. This paper p...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-9890-7