On using approximations of the Benders master problem (Q1333479): 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.1016/0377-2217(94)90032-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999075162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition based heuristic for the hierarchical production planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale mixed integer programming: Benders-type heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of cross decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313622 / 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 Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expedients for solving some specially structured mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank

Latest revision as of 17:50, 22 May 2024

scientific article
Language Label Description Also known as
English
On using approximations of the Benders master problem
scientific article

    Statements

    On using approximations of the Benders master problem (English)
    0 references
    0 references
    17 April 1995
    0 references
    0 references
    Lagrange multipliers
    0 references
    heuristics
    0 references
    Benders' decomposition
    0 references
    Lagrange duality
    0 references
    surrogate duality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references