38 search results - page 4 / 8 » Variable neighborhood search for the dial-a-ride problem |
COR
2006
14 years 11 months ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
EOR
2008
14 years 11 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
104
click to vote
COR
2010
14 years 11 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
MP
2008
14 years 11 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
SAC
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...