Sedeo-Noda A.

A. Sedeo-Noda

Information about the author A. Sedeo-Noda will soon be added to the site.
Found 8 papers in total
The biobjective undirected two-commodity minimum cost flow problem
The biobjective undirected two-commodity minimum cost flow problem
2005
We address the two-commodity minimum cost flow problem considering two objectives. We...
Solving the undirected minimum cost flow problem with arbitrary costs
Solving the undirected minimum cost flow problem with arbitrary costs
2005
We address the undirected minimum cost flow problem with arbitrary arcs costs. Any...
An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs
An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs
2004
In this paper the dynamic lot size problem with time varying storage capacities and...
An alternative method to solve the biobjective minimum cost flow problem
An alternative method to solve the biobjective minimum cost flow problem
2003
Single commodity flow problems simultaneously optimizing two objectives are addressed....
A new characterization for the dynamic lot size problem with bounded inventory
A new characterization for the dynamic lot size problem with bounded inventory
2003
In this paper, we address the dynamic lot size problem with storage capacity. As in...
An algorithmic study of the maximum flow problem: A comparative statistical analysis
An algorithmic study of the maximum flow problem: A comparative statistical analysis
2000
In this paper, we show the results of an experimental study about the most important...
An algorithm for the biobjective integer minimum cost flow problem
An algorithm for the biobjective integer minimum cost flow problem
2001
In this paper, we study the single commodity flow problems, optimizing two objectives...
The biobjective minimum cost flow problem
The biobjective minimum cost flow problem
2000
In this paper, we study the single commodity flow problem, optimizing two objectives...
Papers per page: