A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points

DOI10.1016/S0305-0548(96)00078-0zbMath0882.90032OpenAlexW2038770643MaRDI QIDQ1362973

Alfredo Marín, Blas Pelegrín

Publication date: 7 August 1997

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00078-0

zbMATH Keywords

branch-and-boundLagrangean decomposition\(p\)-median locationtransshipment-related problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (5)

New facets for the two-stage uncapacitated facility location polytope ⋮ Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• 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
• Models for multimode multicommodity location problems with interdepot balancing requirements
• A cost operator approach to multistage location-allocation
• The return plant location problem: Modelling and resolution
• 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
• A branch-and-bound method for multicommodity location with balancing requirements
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
• Multicommodity Distribution System Design by Benders Decomposition
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• A Plant and Warehouse Location Problem
• A branch-and-bound algorithm for depot location and container fleet management
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• A Warehouse-Location Problem
• Site Location via Mixed-integer Programming
• The multi-level uncapacitated facility location problem is not submodular

This page was built for publication: A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points