Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (Q3951912): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Nonlinear Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3932565 / rank | |||
Normal rank | |||
Revision as of 15:23, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints |
scientific article |
Statements
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (English)
0 references
1982
0 references
Lagrangian subproblem
0 references
Lagrangian dual of discrete programming
0 references
separable nonlinear objective function
0 references
linear constraints
0 references
pre-processing
0 references
subgradient optimization
0 references
0 references
