Mixed integer programming approaches for nonlinear and stochastic programming

[1]  Laurence A. Wolsey,et al.  Compact formulations as a union of polyhedra , 2005, Math. Program..

[2]  Hans Kellerer,et al.  Optimization of cardinality constrained portfolios with a hybrid local search algorithm , 2003, OR Spectr..

[3]  Larry L. Schumaker,et al.  Spline Functions on Triangulations: Triangulations and Quadrangulations , 2007 .

[4]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[5]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[6]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[7]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[8]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[9]  R. Kevin Wood,et al.  Explicit-Constraint Branching for Solving Mixed-Integer Programs , 2000 .

[10]  Hrushikesh Narhar Mhaskar,et al.  Fundamentals of Approximation Theory , 2000 .

[11]  Darinka Dentcheva,et al.  On convex probabilistic programming with discrete distributions , 2001 .

[12]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[13]  Franz Aurenhammer,et al.  Towards compatible triangulations , 2001, Theor. Comput. Sci..

[14]  T. Westerlund,et al.  An extended cutting plane method for solving convex MINLP problems , 1995 .

[15]  Ignacio E. Grossmann,et al.  An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms , 2008, Comput. Chem. Eng..

[16]  Susan Powell,et al.  A survey of the operational use of ILP models , 2007, Ann. Oper. Res..

[17]  P. M. Prenter.  Splines and variational methods , 1975 .

[18]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[19]  Egon Balas,et al.  Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization , 2005, Ann. Oper. Res..

[20]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[21]  Thomas L. Magnanti,et al.  Models and Methods for Merge - in - Transit Operations , 2003, Transp. Sci..

[22]  R. Meyer.  Integer and mixed-integer programming models: General properties , 1975 .

[23]  Robert A. Stubbs,et al.  Incorporating estimation errors into portfolio selection: Robust portfolio construction , 2006 .

[24]  Jon Lee,et al.  Polyhedral methods for piecewise-linear functions I: the lambda method , 2001, Discret. Appl. Math..

[25]  George L. Nemhauser,et al.  Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..

[26]  Frank Pettersson,et al.  Optimization of pump configurations as a MINLP problem , 1994 .

[27]  Charles E. Blair.  Representation for multiple right-hand sides , 1991, Math. Program..

[28]  Robert G. Jeroslow,et al.  Representability in mixed integer programmiing, I: Characterization results , 1987, Discret. Appl. Math..

[29]  Stephen P. Boyd,et al.  Portfolio optimization with linear and fixed transaction costs , 2007, Ann. Oper. Res..

[30]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[31]  I. Grossmann.  Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .

[32]  Hai Zhao,et al.  A special ordered set approach for optimizing a discontinuous separable piecewise linear function , 2008, Oper. Res. Lett..

[33]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[34]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[35]  J. K. Lowe.  Modelling with Integer Variables. , 1984 .

[36]  François Margot,et al.  On a Binary-Encoded ILP Coloring Formulation , 2007, INFORMS J. Comput..

[37]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[38]  Sinan Gürel,et al.  A strong conic quadratic reformulation for machine-job assignment with controllable processing times , 2009, Oper. Res. Lett..

[39]  George L. Nemhauser,et al.  Models for representing piecewise linear cost functions , 2004, Oper. Res. Lett..

[40]  Pascal Van Hentenryck,et al.  Simulation of Hybrid Circuits in Constraint Logic Programming , 1989, IJCAI.

[41]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[42]  Andrzej Ruszczynski,et al.  An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems , 2007, Oper. Res..

[43]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[44]  Manfred Padberg,et al.  Location, Scheduling, Design and Integer Programming , 2011, J. Oper. Res. Soc..

[45]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[46]  Steven J. Phillips,et al.  Optimizing wetland restoration and management for avian communities using a mixed integer programming approach , 2009 .

[47]  Christodoulos A. Floudas,et al.  Global Optimization of Gas Lifting Operations: A Comparative Study of Piecewise Linear Formulations , 2009 .

[48]  George L. Nemhauser,et al.  Branch-and-cut for combinatorial optimization problems without auxiliary binary variables , 2001, The Knowledge Engineering Review.

[49]  Jesús M. Carnicer,et al.  Piecewise linear interpolants to Lagrange and Hermite convex scattered data , 1996, Numerical Algorithms.

[50]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[51]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[52]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[53]  Andrés Weintraub,et al.  Integer programming in forestry , 2007, Ann. Oper. Res..

[54]  R. G. Jeroslow,et al.  Experimental Results on the New Techniques for Integer Programming Formulations , 1985 .

[55]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[56]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[57]  Andrzej Ruszczynski,et al.  Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..

[58]  Suvrajeet Sen.  Relaxations for probabilistically constrained programs with discrete random variables , 1992, Oper. Res. Lett..

[59]  G. Ziegler.  Lectures on Polytopes , 1994 .

[60]  George L. Nemhauser,et al.  A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization , 2006, Oper. Res..

[61]  M. Todd.  Union Jack Triangulations , 1977 .

[62]  George L. Nemhauser,et al.  Nonconvex, lower semicontinuous piecewise linear optimization , 2008, Discret. Optim..

[63]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2007, Math. Program..

[64]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[65]  Leon S. Lasdon,et al.  Feature Article - Survey of Nonlinear Programming Applications , 1980, Oper. Res..

[66]  Bernd Hamann,et al.  On piecewise linear approximation of quadratic functions. , 2000 .

[67]  Alexander Martin,et al.  Mixed Integer Models for the Stationary Case of Gas Network Optimization , 2006, Math. Program..

[68]  Ignacio E. Grossmann,et al.  Logic-based outer approximation for globally optimal synthesis of process networks , 2005, Comput. Chem. Eng..

[69]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..

[70]  J. Tomlin.  A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems* , 1981 .

[71]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[72]  Thomas L. Magnanti,et al.  Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs , 2007, Oper. Res..

[73]  Sven Leyffer,et al.  Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming , 2001, Comput. Optim. Appl..

[74]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[75]  Jon Lee.  All-Different Polytopes , 2002, J. Comb. Optim..

[76]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2008, Math. Program..

[77]  Egon Balas.  Disjunctive Programming , 2010, 50 Years of Integer Programming.

[78]  Don Coppersmith,et al.  Parsimonious binary-encoding in integer programming , 2005, Discret. Optim..

[79]  Dimitris Bertsimas,et al.  Portfolio Construction Through Mixed-Integer Programming at Grantham, Mayo, Van Otterloo and Company , 1999, Interfaces.

[80]  Toshimde Ibaraki.  Integer programming formulation of combinatorial optimization problems , 1976, Discret. Math..

[81]  Ravi Kannan,et al.  Lattice translates of a polytope and the Frobenius problem , 1992, Comb..

[82]  A. S. Manne,et al.  On the Solution of Discrete Programming Problems , 1956 .

[83]  Thomas L. Magnanti,et al.  Separable Concave Optimization Approximately Equals Piecewise Linear Optimization , 2004, IPCO.

[84]  Patrizia Beraldi,et al.  The Probabilistic Set-Covering Problem , 2002, Oper. Res..

[85]  G. Dantzig.  ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .

[86]  Robert G. Jeroslow.  A simplification for some disjunctive formulations , 1988 .

[87]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[88]  Manfred W. Padberg,et al.  Approximating Separable Nonlinear Functions Via Mixed Zero-One Programs , 1998, Oper. Res. Lett..

[89]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

[90]  F. Glineur.  Computational Experiments With a Linear Approximation of Second-Order Cone Optimization , 2000 .

[91]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[92]  Hanif D. Sherali,et al.  Optimization with disjunctive constraints , 1980 .

[93]  K. Ball.  An elementary introduction to modern convex geometry, in flavors of geometry , 1997 .

[94]  Robert G. Jeroslow.  Representability of functions , 1989, Discret. Appl. Math..

[95]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

[96]  Jeff T. Linderoth,et al.  FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .

[97]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[98]  Miguel A. Lejeune,et al.  MIP reformulations of the probabilistic set covering problem , 2010, Math. Program..

[99]  Yazid M. Sharaiha,et al.  Heuristics for cardinality constrained portfolio optimisation , 2000, Comput. Oper. Res..

[100]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[101]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[102]  Ahmet B. Keha.  A polyhedral study of nonconvex piecewise linear optimization , 2003 .

[103]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[104]  Darinka Dentcheva,et al.  Dual methods for probabilistic optimization problems* , 2004, Math. Methods Oper. Res..

[105]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[106]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[107]  Egon Balas.  On the convex hull of the union of certain polyhedra , 1988 .

[108]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[109]  Omprakash K. Gupta,et al.  Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .

[110]  Hanif D. Sherali,et al.  On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions , 2001, Oper. Res. Lett..

[111]  Suvrajeet Sen,et al.  A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems , 2004, Manag. Sci..

[112]  Ivan Gryffenberg,et al.  Guns or Butter: Decision Support for Determining the Size and Shape of the South African National Defense Force , 1997 .

[113]  Ronald L. Rardin,et al.  Optimization in operations research , 1997 .

[114]  R. R. Meyer,et al.  Mixed integer minimization models for piecewise-linear functions of a single variable , 1976, Discret. Math..

[115]  Patrizia Beraldi,et al.  A branch and bound method for stochastic integer problems under probabilistic constraints , 2002, Optim. Methods Softw..

[116]  Dimitris Bertsimas,et al.  Algorithm for cardinality-constrained quadratic optimization , 2009, Comput. Optim. Appl..

[117]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[118]  Brenda L. Dietrich.  Some of my favorite integer programming applications at IBM , 2007, Ann. Oper. Res..

[119]  K. Ball.  An Elementary Introduction to Modern Convex Geometry , 1997 .

[120]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[121]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[122]  Robert R. Meyer,et al.  On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..

[123]  Charles Eugene Blair.  Two Rules for Deducing Valid Inequalities for 0-1 Problems , 1976 .

[124]  Daniel Bienstock,et al.  Computational study of a family of mixed-integer quadratic programming problems , 1995, Math. Program..

[125]  G. Nemhauser,et al.  Integer Programming , 2020 .

[126]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..