Jump to content

Generalized assignment problem: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

28 June 2024

11 January 2024

9 December 2023

16 June 2023

9 December 2021

6 September 2021

27 November 2020

12 July 2020

26 February 2020

25 December 2019

15 September 2019

20 July 2019

24 June 2019

  • curprev 06:3006:30, 24 June 2019Zazke grt talk contribsm 5,637 bytes +10 I made more clear the restriction. The old one could lead non-involved readers to think all costs and benefits were equal, and that is not the case. It just that they do not vary between different agents. undo

6 June 2019

11 February 2018

8 February 2018

4 December 2017

10 June 2017

11 February 2017

10 February 2017

23 December 2015

3 September 2015

2 September 2015

17 June 2015

  • curprev 14:0514:05, 17 June 2015Donandre talk contribs 5,108 bytes −35 Corrected formulation. Items are required to be assigned to exactly one bin, see for example Ross, G. Terry, and Richard M. Soland. "A branch and bound algorithm for the generalized assignment problem." Mathematical programming 8.1 (1975): 91-103. undo

24 April 2015

29 October 2014

5 August 2014

1 July 2014

26 January 2014

1 December 2012

22 November 2012

19 March 2012

10 January 2012

19 October 2011

21 September 2011

22 October 2010

3 June 2010

10 March 2010

11 January 2010

23 November 2009

24 October 2009

8 September 2009

5 September 2009

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)