A New Exterior Point Algorithm for Linear Programming Problems
Konstantinos Dosios, Konstantinos Paparrizos (1994)
The Yugoslav Journal of Operations Research
Similarity:
Konstantinos Dosios, Konstantinos Paparrizos (1994)
The Yugoslav Journal of Operations Research
Similarity:
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Z. Cylkowski, J. Kucharczyk (1969)
Applicationes Mathematicae
Similarity:
M. Sysło (1971)
Applicationes Mathematicae
Similarity:
T. Divnić, Lj. Pavlović (2012)
The Yugoslav Journal of Operations Research
Similarity:
S. Zieliński (1977)
Applicationes Mathematicae
Similarity:
Yanjin Wang, Pusheng Fei (2009)
Control and Cybernetics
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.
Tibor Illès, Katalin Mèszêros (2001)
The Yugoslav Journal of Operations Research
Similarity:
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.
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
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.
Peng Wuliang, Huang Min, Hao Yongping (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...