Paparrizos Konstantinos

Konstantinos Paparrizos

Information about the author Konstantinos Paparrizos will soon be added to the site.
Found 18 papers in total
Exterior point simplex-type algorithms for linear and network optimization problems
Exterior point simplex-type algorithms for linear and network optimization problems
2015
Two decades of research led to the development of a number of efficient algorithms...
On a dual network exterior point simplex type algorithm and its computational behavior
On a dual network exterior point simplex type algorithm and its computational behavior
2012
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network...
Investigating human resource management policies of the information and communications technologies labour market
Investigating human resource management policies of the information and communications technologies labour market
2004
The Information and Communications Technologies (lCT) labour market presents special...
A parametric visualization software for the assignment problem
A parametric visualization software for the assignment problem
2005
In this paper we present a parametric visualization software used to assist the...
An efficient simplex type algorithm for sparse and dense linear programs
An efficient simplex type algorithm for sparse and dense linear programs
2003
We present a big- M method for solving general linear programming problems with a...
A new efficient primal dual simplex algorithm
A new efficient primal dual simplex algorithm
2003
The purpose of this paper is to present a revised primal dual simplex algorithm...
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
2001
We derive new criteria for identifying whether a variable is basic or nonbasic for...
A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
2001
In this paper we deal with the product line design problem employing the seller's...
A genetic algorithm approach to the buyers' welfare problem of product line design: A comparative computational study
A genetic algorithm approach to the buyers' welfare problem of product line design: A comparative computational study
1999
In this paper we present a Genetic Algorithm based heuristic for solving the Product...
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
1997
We resolve the problem of degeneracy in a recently developed primal–dual simplex...
A non improving simplex algorithm for transportation problems
A non improving simplex algorithm for transportation problems
1996
A simplex type algorithm for the Transportation Problem (TP) is presented. TPs with...
A new exterior point algorithm for linear programming problems
A new exterior point algorithm for linear programming problems
1994
The authors present a simplex type algorithm for the linear programming problem min{ c...
An exterior point simplex algorithm for (general) linear programming problems
An exterior point simplex algorithm for (general) linear programming problems
1993
The paper presents an exterior point simplex type algorithm that possesses a new...
A relaxation column signature method for assignment problems
A relaxation column signature method for assignment problems
1991
A recent computational study on algorithms for assignment problems revealed that the...
An infeasible (exterior point) simplex algorithm for assignment problems
An infeasible (exterior point) simplex algorithm for assignment problems
1991
The so called Modified Hung-Rom Algorithm, based upon theoretical considerations of...
Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
1989
The original example of Avis and Chvátal is shown to provide exponential...
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
1988
A combination of a new kind of dual relaxation with the signature idea provides a...
A finite improvement algorithm for the Linear Complementarity Problem
A finite improvement algorithm for the Linear Complementarity Problem
1989
This paper is concerned with the development of an improvement algorithm for the...
Papers per page: