Exact solution methods for uncapacitated location problems with convex transportation costs

DOI10.1016/S0377-2217(98)00039-3MaRDI QIDQ1809831zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg

Publication date 11 October 2000

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

Full work available at URL https://doi.org/10.1016/s0377-2217(98)00039-3

zbMATH Keywords

Benders decompositionbranch-and-bounddual ascentlocation

Mathematics Subject Classification ID

Decomposition methods (49M27) Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A fast exact method for the capacitated facility location problem with differentiable convex production costs
• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• A method for solving to optimality uncapacitated location problems
• A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction

Cites work

• A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A production-transportation problem with stochastic demand and concave production costs
• Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• Lagrangean heuristics for location problems
• Partitioning procedures for solving mixed-variables programming problems

Cited in

(14)

• A fast exact method for the capacitated facility location problem with differentiable convex production costs
• The importance of freight villages: an implementation in TCDD
• A novel differential evolution algorithm for binary optimization
• Solving a capacitated hub location problem
• A bi-level programming model and solution algorithm for the location of logistics distribution centers
• A new approach based on the surrogating method in the project time compression problems
• Discretized formulations for capacitated location problems with modular distribution costs
• scientific article; zbMATH DE number 6911515 (Why is no real title available?)
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
• Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
• A capacitated facility location problem with constrained backlogging probabilities
• Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional

This page was built for publication: Exact solution methods for uncapacitated location problems with convex transportation costs

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