840 search results - page 66 / 168 » Inapproximability of Combinatorial Optimization Problems |
123
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
132
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
124
click to vote
EOR
2006
15 years 2 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
121
click to vote
KES
2008
Springer
15 years 2 months ago
2008
Springer
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
113
Voted
INFORMATICALT
2010
15 years 1 months ago
2010
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...