Buscar
Mostrando ítems 11-20 de 1487
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 relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
(2015-10-29)
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 ...
Solving a distribution network design problem by combining ant colony systems and Lagrangian relaxation
(National Institute for R and D in Informatics, 2015)
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 ...
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 ...
Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
(Pergamon-Elsevier Science Ltd, 2003-03-15)
This paper addresses the relaxations in alternative models for disjunctions, big-M and convex hull model, in order to develop guidelines and insights when formulating Mixed-Integer Non-Linear Programming (MINLP), Generalized ...
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
(Elsevier, 2015)
This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2014)
A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem
(ELSEVIER SCIENCE BV, 2009)
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, 2014)