This dissertation develops theory and methodology based on Fenchel cutting planes for solving stochastic integer programs (SIPs) with binary or general integer variables in the second-stage. The methodology is applied to auto-carrier loading problem under uncertainty. The motivation is that many applications can be modeled as SIPs, but this class of problems is hard to solve. In this dissertation, the underlying parameter distributions are assumed to be discrete so that the original problem can be formulated as a deterministic equivalent mixed-integer program. The developed methods are evaluated based on computational experiments using both real and randomly generated instances from the literature. We begin with studying a methodology using...
A primary objective of Air Traffic Flow Management (ATFM) is to ensure the orderly flow of aircraft ...
Abstract---Many real-world planning problems require search-ing for an optimal solution in the face ...
Some of the most important and challenging problems in computer science and operations research are ...
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming ...
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming ...
DoD's transportation activities incur USD 11+Billion expenditure anually. Optimal resource allocat...
This paper addresses the problem of finding cutting planes for multi-stage stochastic integer progra...
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In...
This paper addresses a general class of two-stage stochastic programs with integer recourse and disc...
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult...
In this dissertation we focus on two main topics. Under the first topic, we develop a new framework ...
We develop scalable algorithms for two-stage stochastic program optimizations. We propose performanc...
Many practical problems from industry that contain uncertain demands, costs and other quantities are...
We consider two classes of stochastic programming models which are motivated by two applications rel...
In this dissertation we study several non-convex and stochastic optimization problems. The common th...
A primary objective of Air Traffic Flow Management (ATFM) is to ensure the orderly flow of aircraft ...
Abstract---Many real-world planning problems require search-ing for an optimal solution in the face ...
Some of the most important and challenging problems in computer science and operations research are ...
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming ...
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming ...
DoD's transportation activities incur USD 11+Billion expenditure anually. Optimal resource allocat...
This paper addresses the problem of finding cutting planes for multi-stage stochastic integer progra...
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In...
This paper addresses a general class of two-stage stochastic programs with integer recourse and disc...
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult...
In this dissertation we focus on two main topics. Under the first topic, we develop a new framework ...
We develop scalable algorithms for two-stage stochastic program optimizations. We propose performanc...
Many practical problems from industry that contain uncertain demands, costs and other quantities are...
We consider two classes of stochastic programming models which are motivated by two applications rel...
In this dissertation we study several non-convex and stochastic optimization problems. The common th...
A primary objective of Air Traffic Flow Management (ATFM) is to ensure the orderly flow of aircraft ...
Abstract---Many real-world planning problems require search-ing for an optimal solution in the face ...
Some of the most important and challenging problems in computer science and operations research are ...