Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design / 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: Refined cut selection for Benders decomposition: applied to network capacity expansion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Facet'' separation with one linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for the single source capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the safety of Gomory cut generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / 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: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition without separability: a computational study for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An In-Out Approach to Disjunctive Optimization / 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: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved cut-and-solve algorithm for the single-source capacitated facility location problem / 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: A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for BILP problems: the single source capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / 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: Practical enhancements to the Magnanti-Wong method / 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: The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders' decomposition for the balancing of assembly lines with stochastic demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cut-and-solve based algorithm for the single-source capacitated facility location problem / rank
 
Normal rank

Revision as of 16:00, 1 August 2024

scientific article; zbMATH DE number 7709805
Language Label Description Also known as
English
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
scientific article; zbMATH DE number 7709805

    Statements

    Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (English)
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    integer programming
    0 references
    Benders' algorithm
    0 references
    branch-and-cut
    0 references
    mixed integer subproblems
    0 references
    facilities planning and design
    0 references
    0 references
    0 references

    Identifiers