A robust heuristic for the generalized assignment problem (Q1339150): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for the Multi-Resource Generalized Assignment Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3751373 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank | |||
Normal rank |
Latest revision as of 09:42, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A robust heuristic for the generalized assignment problem |
scientific article |
Statements
A robust heuristic for the generalized assignment problem (English)
0 references
1 December 1994
0 references
generalized assignment
0 references
variable-depth-search heuristic
0 references
NP-hard
0 references
robustness
0 references