Sciweavers

14739 search results - page 147 / 2948
» An optimization problem on the sphere
Sort
View
COR
2007
90views more  COR 2007»
14 years 10 months ago
Analysis of bounds for a capacitated single-item lot-sizing problem
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 2 months ago
Characterizing a Tunably Difficult Problem in Genetic Programming
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo...
DISOPT
2007
94views more  DISOPT 2007»
14 years 10 months ago
Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused da...
Daniel Bienstock, Sara Mattia
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
15 years 8 months ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
David Gamarnik, David Goldberg, Theophane Weber
LATIN
2000
Springer
15 years 2 months ago
The LCA Problem Revisited
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
Michael A. Bender, Martin Farach-Colton