Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s11590-010-0255-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047557344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / 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: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic, primal convergence in dual subgradient schemes for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / 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: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable target value method for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding the volume algorithm in a variable target value method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of deep disjunctive cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank

Latest revision as of 23:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
scientific article

    Statements

    Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (English)
    0 references
    0 references
    0 references
    30 November 2012
    0 references
    0 references
    disjunctive cuts
    0 references
    reformulation-linearization technique
    0 references
    Lagrangian dual
    0 references
    valid inequalities
    0 references
    partial enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references