A New Exterior Point Algorithm for Linear Programming Problems
Konstantinos Dosios, Konstantinos Paparrizos (1994)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “A Slight Modification of the First Phase of the Simplex Algorithm”
A New Exterior Point Algorithm for Linear Programming Problems
Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
Nikolaos Samaras, Angelo Sifaleras, Charalampos Triantafyllidis (2009)
The Yugoslav Journal of Operations Research
Similarity:
Algorithm 8. A program to shorten a sequence of sets of integer numbers
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
Similarity:
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
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...
Algorithm 38. Calculation of all marginal means from an n-way table
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 31. The calculation of the minimum of a certain function of several variables
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Algorithm 49. An algorithm for solving the machine sequencing problem
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Algorithm 30. The calculation of the minimum of a certain function of one variable
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Algorithm 29. Solving systems of linear equations by Sokolov's method
S. Lewanowicz (1974)
Applicationes Mathematicae
Similarity:
Algorithm 12. Minimum of a function of one variable
Z. Cylkowski (1971)
Applicationes Mathematicae
Similarity:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
A modified algorithm for the strict feasibility problem
D. Benterki, B. Merikhi (2010)
RAIRO - Operations Research
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.