Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0664-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107774361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for problems with additive variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Study of Integer Variable Upper Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes in integer and mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polyhedral structure of a multi-item production planning model with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted inequalities for 0-1 mixed integer programming: superlinear lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting for mixed integer programs with variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:12, 11 June 2024

scientific article
Language Label Description Also known as
English
Sequence independent lifting for mixed integer programs with variable upper bounds
scientific article

    Statements

    Sequence independent lifting for mixed integer programs with variable upper bounds (English)
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    Mixed integer programming
    0 references
    Polyhedral theory
    0 references
    0 references

    Identifiers