Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel Cutting Planes for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / 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: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes / 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: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems / 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: Q4231138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multipliers in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lagrangean Techniques for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137910 / rank
 
Normal rank

Latest revision as of 14:03, 29 May 2024

scientific article
Language Label Description Also known as
English
Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
scientific article

    Statements

    Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (English)
    0 references
    0 references
    23 March 2000
    0 references
    linear programming relaxations
    0 references
    Fenchel cutting planes
    0 references
    Lagrangean relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers