Discretized formulations for capacitated location problems with modular distribution costs

DOI10.1016/j.ejor.2009.10.027zbMath1178.90223OpenAlexW2023907835MaRDI QIDQ2655611

Francisco Saldanha-Da-gama, Luís Gouveia, Isabel H. Correia

Publication date: 25 January 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.10.027

zbMATH Keywords

capacitated facility locationextended reformulationsmodular link costs

Mathematics Subject Classification ID

Continuous location (90B85) Linear programming (90C05)

Related Items (12)

Exactly solving a two-level location problem with modular node capacities ⋮ The mixed capacitated general routing problem under uncertainty ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ Facets for the single node fixed-charge network set with a node set-up variable ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A knapsack problem as a tool to solve the production planning problem in small foundries ⋮ Unnamed Item ⋮ Determining the best shipper sizes for sending products to customers ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Cites Work

• Unnamed Item
• The convex hull of two core capacitated network design problems
• 0-1 reformulations of the multicommodity capacitated network design problem
• Valid inequalities and facets of the capacitated plant location problem
• A Lagrangean heuristic for a modular capacitated location problem
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Exact solution methods for uncapacitated location problems with convex transportation costs
• Capacitated facility location problem with general setup cost
• On the capacitated concentrator location problem: a reformulation by discretization
• Description of 2-integer continuous knapsack polyhedra
• The facility location problem with general cost functions
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Capacitated facility location/network design problems.

This page was built for publication: Discretized formulations for capacitated location problems with modular distribution costs