Algorithm 3. Solution of zero-one integer linear programming problems by Balas' method
Z. Cylkowski, J. Kucharczyk (1969)
Applicationes Mathematicae
Similarity:
Z. Cylkowski, J. Kucharczyk (1969)
Applicationes Mathematicae
Similarity:
M. Sysło (1971)
Applicationes Mathematicae
Similarity:
Nikolaos Samaras, Angelo Sifaleras, Charalampos Triantafyllidis (2009)
The Yugoslav Journal of Operations Research
Similarity:
S. Zieliński (1977)
Applicationes Mathematicae
Similarity:
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
M. Tlas, B. Abdul Ghani (2005)
Control and Cybernetics
Similarity:
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
Pang, Li-Ping, Xia, Zun-Quan (2003)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 90C25, 68W10, 49M37. A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function and an ε-descent...
Moncef Abbas, Djamal Chaabane (2010)
RAIRO - Operations Research
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.
José Luis Quintero, Alejandro Crema (2009)
RAIRO - Operations Research
Similarity:
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.