Methods for a class of discrete location problems

DOI10.1080/02331938508843052zbMath0583.90020OpenAlexW1995428829MaRDI QIDQ3706797

Ivan Martinec

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843052

zbMATH Keywords

integer linear programmingapproximate methodsimplicit enumeration methoduncapacitated plant location\(\epsilon \) -optimal solutionstwo-state location problems

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

This page was built for publication: Methods for a class of discrete location problems