A branch-and-price algorithm for the Multiple Knapsack Problem

Olivier Lalonde, Jean-François Côté, Bernard Gendron

Year of publication:	December 2021
Authors:	Lalonde, Olivier ; Côté, Jean-François ; Gendron, Bernard
Publisher:	Montréal (Québec) : Bureau de Montreal, Université de Montreal
Subject:	Multiple Knapsack Problem \| branch-and-price \| Lagrangian relaxation \| Theorie \| Theory \| Ganzzahlige Optimierung \| Integer programming \| Mathematische Optimierung \| Mathematical programming \| Branch-and-Bound \| Branch and Bound

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012792227

A service of the