Sciweavers

MP
2010
100views more  MP 2010»
13 years 10 months ago
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...
Mohit Tawarmalani, Jean-Philippe P. Richard, Kwang...
MP
2010
116views more  MP 2010»
13 years 10 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
MP
2010
99views more  MP 2010»
13 years 10 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
MP
2010
128views more  MP 2010»
13 years 10 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
MP
2010
62views more  MP 2010»
13 years 10 months ago
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
MP
2010
80views more  MP 2010»
13 years 10 months ago
Nonlinear programming without a penalty function or a filter
Nicholas I. M. Gould, Philippe L. Toint
MP
2010
135views more  MP 2010»
13 years 10 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
MP
2010
82views more  MP 2010»
13 years 10 months ago
Conic mixed-integer rounding cuts
Alper Atamtürk, Vishnu Narayanan