Sciweavers

15 search results - page 2 / 3
» Convex Programming Upper Bounds on the Capacity of 2-D Const...
Sort
View
MP
2008
99views more  MP 2008»
13 years 5 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
WIOPT
2010
IEEE
13 years 3 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
MP
2010
128views more  MP 2010»
13 years 3 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
SSD
2005
Springer
188views Database» more  SSD 2005»
13 years 10 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
MP
2006
120views more  MP 2006»
13 years 5 months ago
Lot-sizing with production and delivery time windows
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
Laurence A. Wolsey