Methods for a class of discrete location problems

DOI10.1080/02331938508843052MaRDI QIDQ3706797zbMATH OpenOpenAlexFDO

Authors 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

\(\epsilon \) -optimal solutionsapproximate methodsimplicit enumeration methodinteger linear programmingtwo-state location problemsuncapacitated plant location

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4020810
• The plant location problem with discrete capacities and indivisible customers
• Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
• Approximation of solutions for location problems
• scientific article; zbMATH DE number 970362

Cites work

• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• Technical Note—A Flexible Tree-Search Method for Integer Programming Problems

Cited in

(13)

• A flexible model and efficient solution strategies for discrete location problems
• On the set partitioning type formulation for the discrete location problem
• A discretizing algorithm for location problems
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• A discrete location problem
• Approximation of solutions for location problems
• A bibliography for some fundamental problem categories in discrete location science
• scientific article; zbMATH DE number 4020810 (Why is no real title available?)
• Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
• Base Location Problems for Base-Monotone Regions
• Discrete Monotonic Optimization with Application to a Discrete Location Problem
• Good solutions to discrete noxious location problems via metaheuristics
• Discrete location problems with push-pull objectives

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

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