Karkazis John

John Karkazis

Information about the author John Karkazis will soon be added to the site.
Found 8 papers in total
A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
1992
In this paper the authors introduce a nonlinear model for the location of obnoxious...
Models and methods for location and routing decisions relating to hazardous materials
Models and methods for location and routing decisions relating to hazardous materials
1993
The location of obnoxious facilities and/or the routing of vehicles carrying hazardous...
Evaluation of location and stack height of polluting units in industrial areas
Evaluation of location and stack height of polluting units in industrial areas
1994
Depending upon the prevailing meteorological conditions and the way urban population...
Location of a facility in a competitive environment: A planar-based approach
Location of a facility in a competitive environment: A planar-based approach
1994
The problem of locating a new facility on the plane, that will compete with a set of...
Modelling pollution spread
Modelling pollution spread
1994
The problem of locating facilities causing airborne pollution on the plane has already...
A quantitative model for evaluating the impact of a polluting stack
A quantitative model for evaluating the impact of a polluting stack
1991
This paper presents a mathematical model for a quantitative evaluation of the...
Facilities location in a competitive environment: A promethee based multiple criteria analysis
Facilities location in a competitive environment: A promethee based multiple criteria analysis
1989
In this paper, a methodology for locating facilities in a competitive environment is...
The general unweighted problem of locating obnoxious facilities on the plane
The general unweighted problem of locating obnoxious facilities on the plane
1988
In this paper the following generalization of the spatial structure of the efficient...
Papers per page: