A monotonic, dual-based bounding procedure for integer programs (Q1894724): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Dynamic Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / 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: Column generation applied to linear programs in course registration / rank
 
Normal rank

Latest revision as of 15:54, 23 May 2024

scientific article
Language Label Description Also known as
English
A monotonic, dual-based bounding procedure for integer programs
scientific article

    Statements

    A monotonic, dual-based bounding procedure for integer programs (English)
    0 references
    24 July 1995
    0 references
    0 references
    integer linear programs
    0 references
    0 references