scientific article; zbMATH DE number 1285999

MaRDI QIDQ4242550zbMATH OpenFDO

Authors E. N. Goncharov

Publication date 11 May 1999

zbMATH Keywords

distribution systemdual ascent procedurepolynomial in Boolean variablesstandardization problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• scientific article; zbMATH DE number 4202014
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem

Cited in

(9)

• An improved branch \& bound method for the uncapacitated competitive location problem
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
• Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
• Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
• An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method
• scientific article; zbMATH DE number 1432158 (Why is no real title available?)
• scientific article; zbMATH DE number 1431668 (Why is no real title available?)
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242550)