Solving the reliability-oriented generalized assignment problem by Lagrangian relaxation and Alternating Direction Method of Multipliers

Lower and upper bounds for the non-linear generalized assignment problem

(2020) Claudia D’Ambrosio et al.   COMPUTERS & OPERATIONS RESEARCH

Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

(2018) Salim Haddadi   4OR-A Quarterly Journal of Operations Research

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem

(2018) Wei Wu et al.   COMPUTERS & INDUSTRIAL ENGINEERING

Improved differential evolution algorithms for solving generalized assignment problem

(2016) Kanchana Sethanan et al.   EXPERT SYSTEMS WITH APPLICATIONS

An exact algorithm for the mean–standard deviation shortest path problem

(2015) Alireza Khani et al.   TRANSPORTATION RESEARCH PART B-METHODOLOGICAL

An exact method with variable fixing for solving the generalized assignment problem

(2011) Marius Posta et al.   COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

The multi-resource agent bottleneck generalised assignment problem

(2011) Özlem Karsu et al.   INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

(2011) Tao Xing et al.   TRANSPORTATION RESEARCH PART B-METHODOLOGICAL

A hybrid tabu search/branch & bound approach to solving the generalized assignment problem

(2010) Andrew J. Woodcock et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Vehicle routing with stochastic time-dependent travel times

(2009) C. Lecluyse et al.   4OR-A Quarterly Journal of Operations Research