840 search results - page 90 / 168 » Inapproximability of Combinatorial Optimization Problems |
136
Voted
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 4 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
76
Voted
EOR
2007
15 years 12 days ago
2007
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
133
click to vote
ICCV
2011
IEEE
14 years 14 days ago
2011
IEEE
We propose a novel statistical manifold modeling approach that is capable of classifying poses of object categories from video sequences by simultaneously minimizing the intra-cla...
133
click to vote
CEC
2011
IEEE
14 years 13 days ago
2011
IEEE
Abstract—Protein structure prediction is the problem of finding the functional conformation of a protein given only its amino uence. The HP lattice model is an abstract formulat...
TALG
2008
15 years 11 days ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...