Buscar
Mostrando ítems 1-10 de 1487
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
(2015-01-01)
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
(Wiley-blackwellMaldenEUA, 2011)
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)
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. ...
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. ...
Lagrangian Relaxation for an Inventory Location Problem with Periodic Inventory Control and Stochastic Capacity Constraints
(2018)
We studied a joint inventory location problem assuming a periodic review for inventory control. A single plant supplies a set of products tomultiple warehouses and they serve a set of customers or retailers.The problem ...
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
(Elsevier Science BvAmsterdamHolanda, 2006)
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 ...