2636 search results - page 183 / 528 » Linear Programming |
115
click to vote
CCE
2004
15 years 2 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
122
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
119
Voted
ORL
1998
15 years 2 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
102
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
114
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...