40 search results - page 5 / 8 » Differential approximation results for the traveling salesma... |
MP
2006
13 years 7 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
SASO
2007
IEEE
14 years 2 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...