SSCFLPsolver

MaRDI QIDQ46583swMATHFDO

Official website https://github.com/SuneGadegaard/SSCFLPsolver

Source code repository https://github.com/SuneGadegaard/SSCFLPsolver

Described by source

• An improved cut-and-solve algorithm for the single-source capacitated facility location problem

Cited in

(12)

• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• The complete vertex \(p\)-center problem
• An integrated approach for a new flexible multi-product disassembly line balancing problem
• Solving the facility location and fixed charge solid transportation problem
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
• Knapsack
• MULKNAP
• BEAMR
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
• Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• An effective hybrid approach to the two-stage capacitated facility location problem

This page was built for software: SSCFLPsolver