Now showing items 1-10 of 649
A Relax-and-Cut algorithm for the set partitioning problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2008)
Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the ...
Exact Algorithms for the Vertex Separator Problem in Graphs
Lagrangean relaxation heuristics for thep-cable-trench problem
A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem
(Elsevier B.V., 2009-06-01)
Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. ...
Calculating the Best Dual Bound for Problems with Multiple Lagrangian Relaxations
(Maik Nauka/interperiodica/springer, 2010-12-01)
There are often many ways in which a given problem can be relaxed in a Lagrangian fashion. It is not obvious a priori, which relaxation produces the best bound. Moreover, a bound may appear to be the best for a certain ...
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
(Elsevier Science BvAmsterdamHolanda, 2006)
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
In this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2004-05-01)
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation ...