Adlakha Veena

Veena Adlakha

Information about the author Veena Adlakha will soon be added to the site.
Found 9 papers in total
More-for-less algorithm for fixed-charge transportation problems
More-for-less algorithm for fixed-charge transportation problems
2007
The more-for-less (MFL) phenomenon in distribution problems occurs when it is possible...
Heuristic algorithms for the fixed-charge transportation problem
Heuristic algorithms for the fixed-charge transportation problem
2006
In a recent paper, Adlakha and Kowalski present a heuristic algorithm for solving...
A simple heuristic for solving small fixed-charge transportation problems
A simple heuristic for solving small fixed-charge transportation problems
2003
The fixed-charge transportation problem is an extension of the classical...
On the fixed-charge transportation problem
On the fixed-charge transportation problem
1999
In many distribution problems, the transportation cost consists of a fixed cost,...
An alternate linear algorithm for the minimum flow problem
An alternate linear algorithm for the minimum flow problem
1999
We present an alternate linear algorithm for finding the minimum flow in ( s, t...
A quick sufficient solution to the more-for-less paradox in the transportation problem
A quick sufficient solution to the more-for-less paradox in the transportation problem
1998
In a transportation problem, is it possible to find a solution with less (or equal)...
Scheduling travelling inspectors
Scheduling travelling inspectors
1997
This article describes the development of a decision support system to help a US...
Service levels for priority and nonpriority products with a common component
Service levels for priority and nonpriority products with a common component
1988
This paper refers to an article by Baker, recently published in the Journal of...
Two heuristic techniques for service location: An evaluation and comparison
Two heuristic techniques for service location: An evaluation and comparison
1989
This paper presents a comparison/evaluation of heuristic methods that have been...
Papers per page: