270 search results - page 26 / 54 » Constraint relaxation in approximate linear programs |
106
click to vote
AUTOMATICA
1999
15 years 3 days ago
1999
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
82
Voted
DAM
2010
15 years 16 days ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
124
click to vote
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
120
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
136
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...