Approximation algorithms for integer covering problems via greedy column generation
Y. Crama, J. Van De Klundert (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Y. Crama, J. Van De Klundert (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Hadda Cherroun, Alain Darte, Paul Feautrier (2007)
RAIRO - Operations Research
Similarity:
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...
Laurent Alfandari (2007)
RAIRO - Operations Research
Similarity:
The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time...
Frederic Messine (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.
Oto Hudec, Karel Zimmermann (1993)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Nelson Maculan, Marcos de Mendonça Passini, José André de Moura Brito, Irene Loiseau (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application...
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Matic, Dragan (2012)
Serdica Journal of Computing
Similarity:
This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jérôme Monnot (2002)
The Yugoslav Journal of Operations Research
Similarity: