The vendor location problem

DOI10.1016/J.COR.2011.02.011MaRDI QIDQ547116zbMATH OpenOpenAlexFDO

Authors Yüce Çınar, Hande Yaman

Publication date 30 June 2011

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/21710

zbMATH Keywords

computational complexityhierarchical facility locationlocationvalid inequalitiesvendor location problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On a profit maximizing location model
• Joint Location/Sizing Maximum Profit Covering Models
• The generalized maximal covering location problem
• scientific article; zbMATH DE number 1323030
• On a general network location--production--allocation problem

Cites work

• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• 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
• A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A new approximation algorithm for the multilevel facility location problem
• A note on the maximization version of the multi-level facility location problem
• A Plant and Warehouse Location Problem
• A review of hierarchical facility location models
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• An exact method for the two-echelon, single-source, capacitated facility location problem
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• Approximating the two-level facility location problem via a quasi-greedy approach
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1253065 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• scientific article; zbMATH DE number 1833402 (Why is no real title available?)
• Improved approximation algorithms for multilevel facility location problems
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• Lower bounds for the two-stage uncapacitated facility location problem
• On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
• On the Two-Level Uncapacitated Facility Location Problem
• Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
• The capacity and distance constrained plant location problem
• Uncapacitated facility location: General solution procedure and computational experience
• Upper and lower bounds for the two-level simple plant location problem

Cited in

(2)

• Multi-level facility location problems
• The splittable flow arc set with capacity and minimum load constraints

This page was built for publication: The vendor location problem

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