Displaying similar documents to “A computational approach to pivot selection in the LP relaxation of set problems.”

Fast computation of the leastcore and prenucleolus of cooperative games

Joseph Frédéric Bonnans, Matthieu André (2008)

RAIRO - Operations Research

Similarity:

The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among players. It has, however, the drawback being a linear programming problem with 2 - 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially...

Column-generation in integer linear programming

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...

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Joanna Kołodziej, Fatos Xhafa (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies,...

Coeur et nucléolus des jeux de recouvrement

Nicolas Preux, Fatiha Bendali, Jean Mailfert, Alain Quilliot (2010)

RAIRO - Operations Research

Similarity:

A cooperative game is defined as a set of players and a cost function. The distribution of the whole cost between the players can be done using the core concept, that is the set of all undominated cost allocations which prevent players from grouping. In this paper we study a game whose cost function comes from the optimal solution of a linear integer covering problem. We give necessary and sufficient conditions for the core to be nonempty and characterize its allocations using linear...

Articles ROADEF 2007

Christian Artigues, Van-Dat Cung, Gerd Finke, Bernard Penz (2009)

RAIRO - Operations Research

Similarity:

An algorithm for solving multiple objective integer linear programming problem

Moncef Abbas, Djamal Chaabane (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.

Large neighborhood improvements for solving car sequencing problems

Bertrand Estellon, Frédéric Gardi, Karim Nouioua (2006)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The 𝒩 P -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness...