We show that Karger’s randomized contraction method [7] can be adapted to multiobjective global minimum cut problems with a constant number of edge or node budget constraints to give efficient algorithms. For global minimum cuts with a single edge-budget constraint, our extension of the randomized contraction method has running time Õ(n3) in an n-node graph improving upon the best-known randomi...

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.04.019 * Corresponding author. E-mail addresses: [email protected] (M.W. Ta Ntaimo). We present a new method for solving stochastic programs with joint chance constraints with random technology matrices and discretely distributed random data. The problem can be reformulated as a large-scale mixed 0–1 integer program. We de...

This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide class of energy functions. However, the extraction of objects in a complex background often requires a lot of user interaction. The proposed algori...

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

In integer programming, the elementary closure associated with a family of cuts is the convex set de ned by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory’s fractional cuts, three versions of Gomory’s mixed integer cuts, two versions of intersection cuts and their strengt...

due to the special nature of agricultural activities and results of decisions influenced by the risk and uncertainty of these activities, consideration risk is essential in planning for agriculture sector. interval-valued fuzzy programming approach is advantage of in this study for considering the conditions of uncertainty and additionally emphasizing on the limitation of water resources in def...

Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special c...

â â â â  â  abstract â  most debates about the role of tariff cuts on the level of employment and rate of wages in labor market have come out of well-known hecscher – ohlin and stopler – samuelson (hos) theorems. considering the fact that we have divided the workforce into skilled and unskilled labors the present paper assesses the impacts of tariff cuts on labor market indicators in iran. ...

In integer programming, the elementary closure associated with a family of cuts is the convex set de ned by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two versions of intersection cuts and their strengt...

This paper presents a model for microgrid optimal scheduling considering multi-period islanding constraints. The objective of the problem is to minimize the microgrid total operation cost which comprises the generation cost of local resources and cost of energy purchase from the main grid. The microgrid optimal scheduling problem is decomposed into a gridconnected operation master problem and a...