Greedy approaches for a class of nonlinear Generalized Assignment Problems

Discrete Applied Mathematics

Volumn 158, Issue 5, 2010, Pages 559-572

  Sharkey, Thomas C ^a   Romeijn, H Edwin ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Asymptotic analysis; Greedy heuristics; Nonlinear Generalized Assignment Problem

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CONTINUOUS RELAXATION; GENERALIZED ASSIGNMENT PROBLEM; GREEDY ALGORITHMS; GREEDY HEURISTICS; LINEAR FUNCTIONS; NONLINEAR COST FUNCTIONS; NONLINEAR GENERALIZED ASSIGNMENT PROBLEM; OPTIMAL SOLUTIONS;

ALGORITHMS; HEURISTIC METHODS; NONLINEAR ANALYSIS; STOCHASTIC MODELS; TRAVELING SALESMAN PROBLEM;

ASYMPTOTIC ANALYSIS;

EID: 75449112396     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.11.002     Document Type: Article

References (16)

1. Ahuja R.K., Huang W., Romeijn H.E., and Romero Morales D. A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints. INFORMS Journal on Computing 19 (2007) 14-26
2. Bertsekas D.P. Nonlinear Programming. 2nd edition (1999), Athena Scientific, Belmont, MA
3. Dyer M., and Frieze A. Probabilistic analysis of the generalised assignment problem. Mathematical Programming 55 (1992) 169-181
4. Freling R., Romeijn H.E., Romero Morales D., and Wagelmans A.P.M. A branch-and-price algorithm for the multi-period single-sourcing problem. Operations Research 51 6 (2003) 922-939
5. Hiriart-Urruty J.B. On optimality conditions in nondifferentiable programming. Mathematical Programming 14 (1978) 73-86
6. Huang W., Romeijn H.E., and Geunes J. The continuous-time single-sourcing problem with capacity expansion opportunities. Naval Research Logistics 52 3 (2005) 193-211
7. Martello S., and Toth P. An algorithm for the generalized assignment problem. In: Brans J.P. (Ed). Operational Research (1981), North-Holland, Amsterdam, The Netherlands 589-603
8. Munkres J.R. Topology (1975), Prentice-Hall, Englewood Cliffs, NJ
9. Nemirovski A.S., and Todd M.J. Interior-point methods for optimization. Acta Numerica 17 (2008) 191-234
10. Nesterov Y., and Nemirovski A.S. Interior Point Polynomial Time Methods in Convex Programming (1994), SIAM, Philadelphia, PA
11. Rainwater C., Geunes J., and Romeijn H.E. The generalized assignment problem with flexible jobs. Discrete Applied Mathematics 157 1 (2009) 49-67
12. Romeijn H.E., and Piersma N. A probabilistic feasibility and value analysis of the generalized assignment problem. Journal of Combinatorial Optimization 3 (2000) 325-355
13. Romeijn H.E., and Romero Morales D. A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics 103 (2000) 209-235
14. Romeijn H.E., and Romero Morales D. An asymptotically optimal greedy heuristic for the multi-period single-sourcing problem: The cyclic case. Naval Research Logistics 50 5 (2003) 412-437
15. Romeijn H.E., and Romero Morales D. Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case. Journal of Heuristics 10 (2004) 5-35
16. Shen Z.J., Coullard C., and Daskin M.S. A joint location-inventory model. Transportation Science 37 1 (2003) 40-55