A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem (Q2784114): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.44.12.s271 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120024198 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem |
scientific article |
Statements
A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem (English)
0 references
17 April 2002
0 references
generalized multi-assignment problem
0 references
generalized assignment problem
0 references
Lagrangian dual ascent
0 references
subgradient search
0 references
Lagrangian dual-based branch-and-bound
0 references
