The concave cost supply problem

European Journal of Operational Research

Volumn 148, Issue 2, 2003, Pages 374-383

  Chauhan, Satyaveer Singh ^a   Proth, Jean Marie ^a,b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b INRIA   (France)

Author keywords

Assignment; Concave cost; Heuristic; Supply

Indexed keywords

ALGORITHMS; COSTS; HEURISTIC METHODS; OPTIMIZATION; PRODUCTION CONTROL;

CONCAVE COSTS;

OPERATIONS RESEARCH;

EID: 0037449233     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00407-1     Document Type: Article

References (5)

1. Dueck G., Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics. 90:1990;161-175.
2. Goldberg D.E. Genetic Algorithm in Search, Optimization and Machine Learning. 1989;Addison-Wesley, New York.
3. Kirkpatric S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
4. Larsson T., Migdalas A., Ronnqvist M. A Langrangian heuristic for the capacited concave minimum cost network flow problem. European Journal of Operational Research. 78:1994;116-129.
5. Yan S., Luo S.-C. Probabilistic local search algorithms for concave cost transportation network problems. European Journal of Operational Research. 117:1999;511-521.