An Enumerative Algorithm for Non-Linear Multi-Level Integer Programming Problem
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Yi-Chih Hsieh (2002)
The Yugoslav Journal of Operations Research
Similarity:
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
Dias, Bruno H., Marcato, André L.M., Souza, Reinaldo C., Soares, Murilo P., Junior, Ivo C.Silva, de Oliveira, Edimar J., Brandi, Rafael B.S., Ramos, Tales P. (2010)
Mathematical Problems in Engineering
Similarity:
R. Mansi, S. Hanafi, L. Brotcorne (2010)
Mathematical Modelling of Natural Phenomena
Similarity:
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity: