840 search results - page 80 / 168 » Inapproximability of Combinatorial Optimization Problems |
112
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
MVA
1998
15 years 1 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
102
click to vote
ICSR
2000
Springer
15 years 4 months ago
2000
Springer
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...
SARA
2000
Springer
15 years 4 months ago
2000
Springer
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
101
Voted
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...