Search Results - subject:"Lagrangean relaxation"

A new Semi-Lagrangean Relaxation for the p-median problem

Butsch, Alex; Jörnsten, Kurt; Kalcsics, Jörg - Institutt for foretaksøkonomi, Norges Handelshøyskole … - 2015

Recently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median location problem. The … results obtained using the Semi-Lagrangean relaxation approach were quite impressive. In this paper we use a reformulation of … the p-median problem in order to start from a formulation more suitable for Semi-Lagrangean relaxation and analyse the new …

Persistent link: https://www.econbiz.de/10011118582

A new Lagrangean Approach for the Travelling Salesman Problem

Jörnsten, Kurt; Kalcsics, Jörg - Institutt for foretaksøkonomi, Norges Handelshøyskole … - 2015

Lagrangean relaxation and analyse the new approach on examples from TSP Lib. Furthermore the Lagrangean relaxed subproblems are …

Persistent link: https://www.econbiz.de/10011124337

A New Semi-Lagrangean Relaxation for the K-Cardinality Assignment Problem

Belik, Ivan; Jörnsten, Kurt - Institutt for foretaksøkonomi, Norges Handelshøyskole … - 2014

Recently Beltrán-Royo, Vial & Alonso-Ayuso (2012) presented a semi-Lagrangean relaxation for the classical p … relaxation approach, were quite impressive. In this paper we use a semi-Lagrangean relaxation to obtain an efficient solution … limited number of values, making the search for the optimal multiplier easy. Since the semi-Lagrangean relaxation closes the …

Persistent link: https://www.econbiz.de/10011098239

Reformulation and decomposition of integer programs

VANDERBECK, François; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2009

algorithm. First we cover in detail reformulations based on decomposition, such as Lagrangean relaxation, Dantzig-Wolfe column …

Persistent link: https://www.econbiz.de/10008550200

Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP

Elendner, Thomas - 2003

In this paper we consider the following problem: a Company wants to sell consecutive time slots on a single machine. It wants to maximize the revenues, whereby market prizes are not known. Additionally, consider a number of potential buyers of those time slots providing each at least one job....

Persistent link: https://www.econbiz.de/10011558787

Combining Column Generation and Lagrangian Relaxation

Huisman, Dennis; Jans, Jans, R.F.; Peeters, Peeters, M.; … - Erasmus Research Institute of Management (ERIM), … - 2003

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master...

Persistent link: https://www.econbiz.de/10010837615