A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1287/ijoc.2022.1207 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283016545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Production Routing Under Demand Uncertainty / 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: Integer Programming: Methods, Uses, Computations / 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: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined cut selection for Benders decomposition: applied to network capacity expansion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Facet'' separation with one linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / 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: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition approach for the robust network design problem with flow bifurcations / 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: An interior-point Benders based branch-and-cut algorithm for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benders decomposition algorithm: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5447758 / rank
 
Normal rank

Latest revision as of 00:28, 31 July 2024

scientific article; zbMATH DE number 7625904
Language Label Description Also known as
English
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
scientific article; zbMATH DE number 7625904

    Statements

    A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2022
    0 references
    Benders decomposition algorithm
    0 references
    optimality cut
    0 references
    fractional programming problem
    0 references
    Pareto-optimal cut
    0 references
    multicommodity capacitated fixed-charge network design problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers