53 search results - page 3 / 11 » Backdoors to Combinatorial Optimization: Feasibility and Opt... |
84
Voted
MP
2002
14 years 10 months ago
2002
Using standard nonlinear programming (NLP) theory, we establish formulas for first and second order directional derivatives for optimal value functions of parametric mathematical ...
90
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
106
Voted
FOCM
2010
14 years 8 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
81
Voted
FGCS
2000
14 years 10 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
70
Voted
STOC
1999
ACM
15 years 2 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...