Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Production Scheduling for a Process Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layering strategies for creating exploitable structure in linear and integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition for integer programming : theory and applications / 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: Lagrangean decomposition for integer nonlinear programming with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean Decomposition In Integer Linear Programming: A New Scheme / rank
 
Normal rank

Revision as of 11:02, 28 May 2024

scientific article
Language Label Description Also known as
English
Polyhedral analysis and decompositions for capacitated plant location-type problems
scientific article

    Statements

    Identifiers

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