32 search results - page 1 / 7 » Variable neighborhood search and local branching |
COR
2006
13 years 4 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...
COR
2010
13 years 4 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...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
This paper proposes two modifications to the geometrically deformable template model. First, the optimization stage originally based on simulated annealing is replaced with a meta...
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
EVOW
2012
Springer
12 years 7 days ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...