From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655): 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 / author
 
Property / author: Daniel Cosmin Porumbel / rank
Normal rank
 
Property / author
 
Property / author: Daniel Cosmin Porumbel / 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.1016/j.disopt.2018.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809615149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation / 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: The Benders decomposition algorithm: a literature review / 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: Benders, metric and cutset inequalities for multicommodity capacitated network design / 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: Exact approaches to the single-source network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with linear fractional functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank

Latest revision as of 09:22, 16 July 2024

scientific article
Language Label Description Also known as
English
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
scientific article

    Statements

    From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (English)
    0 references
    20 August 2018
    0 references
    Benders decomposition
    0 references
    cutting-planes
    0 references
    intersection sub-problem
    0 references

    Identifiers