Sciweavers

55 search results - page 4 / 11
» An algorithmic framework for convex mixed integer nonlinear ...
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
CCE
2005
13 years 7 months ago
Wastewater minimisation using central reusable water storage in batch plants
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
Thokozani Majozi
PATMOS
2007
Springer
14 years 1 months ago
Optimization for Real-Time Systems with Non-convex Power Versus Speed Models
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
Ani Nahapetian, Foad Dabiri, Miodrag Potkonjak, Ma...
4OR
2010
148views more  4OR 2010»
13 years 5 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini