Branch-and-Bound Algorithms for a Regional Water Authority Distribution Problem

DOI10.1057/JORS.1995.99MaRDI QIDQ4849288zbMATH OpenOpenAlexFDO

Authors Barrie Baker, Amândio Pereira Baía

Publication date 25 September 1995

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1995.99

zbMATH Keywords

branch- and-boundcapacitated warehouse location problemLagrangian relaxation

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Integer programming (90C10)

Recommendations

• An algorithm for solving large capacitated warehouse location problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
• A Lagrangian based branch-and-bound algorithm for production-transportation problems

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Branch-and-Bound Algorithms for a Regional Water Authority Distribution Problem

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