An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A cutting plane method from analytic centers for stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / 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: A survey on Benders decomposition applied to fixed-charge network design 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: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of an interior-point cutting plane method within a branch-and-price algorithm / 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: 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: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start of the primal-dual method applied in the cutting-plane scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the centralized network design problem on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / 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: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates of some cutting plane methods based on the analytic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of the Maximum on Unimodal Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders method using covering cut bundle generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716341 / rank
 
Normal rank

Latest revision as of 13:28, 7 July 2024

scientific article
Language Label Description Also known as
English
An interior-point Benders based branch-and-cut algorithm for mixed integer programs
scientific article

    Statements

    An interior-point Benders based branch-and-cut algorithm for mixed integer programs (English)
    0 references
    0 references
    0 references
    31 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    Benders decomposition
    0 references
    analytic center cutting plane method
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    0 references
    0 references