3250 search results - page 117 / 650 » An Algorithm to Solve a Linear Program |
139
click to vote
EOR
2010
14 years 12 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
113
Voted
OL
2007
15 years 2 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
118
click to vote
NIPS
2008
15 years 4 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
135
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
140
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...