Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (Q3951912): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01585097 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013484861 / rank
 
Normal rank

Latest revision as of 10:57, 30 July 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references