Search
Now showing items 1-10 of 1532
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 ...
Survivable capacitated network design problem: new formulation and Lagrangean relaxation
(PALGRAVE MACMILLAN LTD, 2000)
This work is focused on the analysis of the survivable capacitated network design problem. This problem can be stated as follows: Given a supply network with point-to-point traffic demands, specific survivability requirements, ...
Exact Algorithms for the Vertex Separator Problem in Graphs
(Wiley-blackwellMaldenEUA, 2011)
Lagrangean relaxation heuristics for the p-cable-trench problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2012)
We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility ...
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 ...