A simple dual ascent algorithm for the multilevel facility location problem

We present a simple dual ascent method for the multilevel facility location problem which finds a solution within $6$ times the optimum for the uncapacitated case and within $12$ times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique. \u

A new approximation algorithm for the multilevel facility location problem

In this paper we propose a new integer programming formulation for the multi-level facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear program we are using has a polynomial number of variables and constraints, being thus more efficient than the one commonly used in the approximation algorithms for this type of problems

The ineffectiveness of central bank intervention

Foreign Exchange;Exchange Rate;Central Banks;Interventions

The incidence of interest withholding taxes: Evidence from the LDC loan markets

Taxation;Interest Rate

The partnered core of an economy

Economic Theory

Real exchange rate misalignment and redistribution

Exchange Rate;Export;Income Distribution

Optimization and sensitivity analysis of computer simulation models by the score function method

Experimental Design;Simulation;Optimization;Queueing Theory