Exact solution methods for uncapacitated location problems with convex transportation costs

DOI10.1016/S0377-2217(98)00039-3zbMath0945.90022OpenAlexW2049821461MaRDI QIDQ1809831

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

branch-and-boundlocationBenders decompositiondual ascent

Mathematics Subject Classification ID

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

Related Items (11)

A novel differential evolution algorithm for binary optimization ⋮ Solving a capacitated hub location problem ⋮ Discretized formulations for capacitated location problems with modular distribution costs ⋮ Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ A bi-level programming model and solution algorithm for the location of logistics distribution centers ⋮ A capacitated facility location problem with constrained backlogging probabilities ⋮ A new approach based on the surrogating method in the project time compression problems ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ The importance of freight villages: an implementation in TCDD ⋮ Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional

Cites Work

• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• A production-transportation problem with stochastic demand and concave production costs
• Lagrangean heuristics for location problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
• A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction

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