270 search results - page 8 / 54 » Constraint relaxation in approximate linear programs |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
UAI
2008
13 years 8 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...