On solving the Lagrangian dual of integer programs via an incremental approach (Q849073): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-007-9149-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9149-2 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985752510 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9149-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985752510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the generalized assignment problem / 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: A Multiplier Adjustment Method for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Method for Solving Convex Finite Min-Max Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Subgradient Methods for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ejection Chain Approach for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach with ejection chains for the generalized assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-007-9149-2 / rank
 
Normal rank

Latest revision as of 05:10, 10 December 2024

scientific article
Language Label Description Also known as
English
On solving the Lagrangian dual of integer programs via an incremental approach
scientific article

    Statements

    On solving the Lagrangian dual of integer programs via an incremental approach (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    convex minimization
    0 references
    Lagrangian relaxation
    0 references
    nonsmooth optimization
    0 references
    bundle methods
    0 references

    Identifiers