Sequential pairing of mixed integer inequalities (Q2471272): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The mixed vertex packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Pairing of Mixed Integer Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic knapsack sets and capacitated lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank

Revision as of 16:39, 27 June 2024

scientific article
Language Label Description Also known as
English
Sequential pairing of mixed integer inequalities
scientific article

    Statements

    Identifiers