Topics in discrete optimization: models, complexity and algorithms

Integer programming;Combinatorial optimization;Stochastic programming;Network flow;Production planning;Computational complexity

He, Qie ; Ahmed, Shabbir Nemhauser, George L. Industrial and Systems Engineering Cook, William J. Dey, Santanu S. Thomas, Robin ; Ahmed, Shabbir

University:Georgia Institute of Technology

Department:Industrial and Systems Engineering

关键词: Integer programming;    Combinatorial optimization;    Stochastic programming;    Network flow;    Production planning;    Computational complexity;   

Others  :  https://smartech.gatech.edu/bitstream/1853/50237/1/HE-DISSERTATION-2013.pdf

美国|英语

来源: SMARTech Repository

【 摘 要 】

In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cutoff. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a type 1 triangle cut is better than a split cut. The analysis also suggests some guidelines on when type 1 triangle cuts are likely to be more effective than split cuts and vice versa. We next study a minimum concave cost network flow problem over a grid network. We give a polytime algorithm to solve this problem when the number of echelons is fixed. We show that the problem is NP-hard when the number of echelons is an input parameter. We also extend our result to grid networks with backward and upward arcs. Our result unifies the complexity results for several models in production planning and green recycling including the lot-sizing model, and gives the first polytime algorithm for some problems whose complexities were not known before. Finally, we examine how much complexity randomness will bring to a simple combinatorial optimization problem. We study a problem called the sell or hold problem (SHP). SHP is to sell k out of n indivisible assets over two stages, with known first-stage prices and random second-stage prices, to maximize the total expected revenue. Although the deterministic version of SHP is trivial to solve, we show that SHP is NP-hard when the second-stage prices are realized as a finite set of scenarios. We show that SHP is polynomially solvable when the number of scenarios in the second stage is constant. A max{1/2,k/n}-approximation algorithm is presented for the scenario-based SHP.