13376 search results - page 354 / 2676 » Problem Solving with |
119
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
143
click to vote
FLAIRS
2004
15 years 5 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
114
click to vote
COR
2007
15 years 4 months ago
2007
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
133
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
120
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...