The vendor location problem
From MaRDI portal
Publication:547116
DOI10.1016/j.cor.2011.02.011zbMath1215.90038OpenAlexW2003058306MaRDI QIDQ547116
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
computational complexityvalid inequalitieslocationhierarchical facility locationvendor location problem
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items (2)
The splittable flow arc set with capacity and minimum load constraints ⋮ Multi-level facility location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 heuristic lagrangean algorithm for the capacitated plant location problem
- Lower bounds for the two-stage uncapacitated facility location problem
- A review of hierarchical facility location models
- The capacity and distance constrained plant location problem
- A new approximation algorithm for the multilevel facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Upper and lower bounds for the two-level simple plant location problem
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- Uncapacitated facility location: General solution procedure and computational experience
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- An exact method for the two-echelon, single-source, capacitated facility location problem
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Improved approximation algorithms for multilevel facility location problems
- A note on the maximization version of the multi-level facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A Plant and Warehouse Location Problem
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- On the Two-Level Uncapacitated Facility Location Problem
This page was built for publication: The vendor location problem
