scientific article; zbMATH DE number 764450

MaRDI QIDQ4836345zbMATH OpenFDO

Authors Andreas Klose

Publication date 14 June 1995

zbMATH Keywords

branch-and-boundLagrangean relaxationsubgradient optimizationuncapacitated facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• A Dual-Based Add Heuristic for Uncapacitated Facility Location
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• A method for solving to optimality uncapacitated location problems
• A branch-and-price algorithm for the capacitated facility location problem

Cited in

(4)

• An interactive procedure dedicated to a bicriteria plant location model.
• An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method
• scientific article; zbMATH DE number 4029232 (Why is no real title available?)
• Pareto-optimality of the Balinski cut for the uncapacitated facility location problem

Describes a project that uses

Uses Software

• OR-Library

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 Q4836345)