A Linear Relaxation Heuristic for the Generalized Assignment Problem

By Michael A. Trick. 1992

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. David Pisinger
2. Stefan Røpke
3. Gerhard Hiermann
4. Hangyu Zhu
5. Jakob Puchinger
6. Richard F. Hartl
7. Yaochu Jin
8. Dominik Goeke

Citations in the corpus

• Real-Time Federated Evolutionary Neural Architecture Search (2020, background): “In [14], [15] relaxation tricks [37] are used to make a weighted sum of candidate operations differentiable so that the gradient descent can be directly employed upon these weights [38].”
• The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (2016, methodology): “Such heuristics have been used by Potvin and Rousseau (1993) for the VRPTW and by Trick (1992) for the Generalized Assignment Problem.”
• A general heuristic for vehicle routing problems (2007, methodology): “Regret heuristics have been used by Potvin and Rou ssea [45] for the VRPTW and in the context of the Generalized Assignment Problem by Trick [58].”