1477 search results - page 122 / 296 » Random Convex Programs |
MP
2006
13 years 8 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
OL
2011
13 years 3 months ago
2011
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
CP
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
JMLR
2012
11 years 11 months ago
2012
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...