Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636412 / rank
 
Normal rank
Property / zbMATH Keywords
 
Benders decomposition
Property / zbMATH Keywords: Benders decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
congested capacitated facility location
Property / zbMATH Keywords: congested capacitated facility location / rank
 
Normal rank
Property / zbMATH Keywords
 
perspective reformulation
Property / zbMATH Keywords: perspective reformulation / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed-integer convex programming
Property / zbMATH Keywords: mixed-integer convex programming / 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.ejor.2016.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2301790113 / 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: An effective heuristic for large-scale capacitated facility location problems / 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: A review of congestion models in the location of facilities with immobile servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs / 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: The congested facility location problem / 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 computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized 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: Perspective Reformulation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location with increasing production costs / 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: Facility location models for distribution system design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / 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: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating congestion in preventive healthcare facility network design / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:17, 12 July 2024

scientific article
Language Label Description Also known as
English
Benders decomposition without separability: a computational study for capacitated facility location problems
scientific article

    Statements

    Benders decomposition without separability: a computational study for capacitated facility location problems (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    Benders decomposition
    0 references
    congested capacitated facility location
    0 references
    perspective reformulation
    0 references
    branch-and-cut
    0 references
    mixed-integer convex programming
    0 references
    0 references

    Identifiers