A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
zbMATH Open document ID: 0882.90032
DOI: 10.1016/S0305-0548(96)00078-0
author: Alfredo Marín
author: B. Pelegrin
published in: Computers \& Operations Research
publication date: 1997-08-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1045750
zbMATH Keywords: transshipment-related problem
zbMATH Keywords: \(p\)-median location
zbMATH Keywords: Lagrangean decomposition
zbMATH Keywords: branch-and-bound
describes a project that uses: OR-Library
MaRDI profile type: Publication
cites work: An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
cites work: The multi-level uncapacitated facility location problem is not submodular
cites work: Q4229633
cites work: A Warehouse-Location Problem
cites work: Q4673630
cites work: On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
cites work: Models for multimode multicommodity location problems with interdepot balancing requirements
cites work: A branch-and-bound method for multicommodity location with balancing requirements
cites work: Site Location via Mixed-integer Programming
cites work: A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
cites work: Uncapacitated facility location: General solution procedure and computational experience
cites work: A branch-and-bound algorithm for depot location and container fleet management
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Lagrangean decomposition for integer programming : theory and applications
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: An application-oriented guide for designing Lagrangean dual ascent algorithms
cites work: Q4320084
cites work: A Plant and Warehouse Location Problem
cites work: The return plant location problem: Modelling and resolution
cites work: Q3993417
cites work: A cost operator approach to multistage location-allocation
cites work: A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
cites work: Q3995028
cites work: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
full work available at URL: s0305-0548(96)00078-0
OpenAlex ID: W2038770643
Recommended article: Q3316957
Recommended article: Some branch-and-bound procedures for fixed-cost transportation problems
Recommended article: A branch and bound procedure for cost minimizing bulk transportation problem
Recommended article: A branch-cut-and-price algorithm for the piecewise linear transportation problem
Recommended article: A branch and bound algorithm for the cyclic job-shop problem with transportation
Recommended article: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
Recommended article: An exact and a heuristic approach for the transportation-\(p\)-facility location problem
Recommended article: Q4886440
Recommended article: A Lagrangian based branch-and-bound algorithm for production-transportation problems
Recommended article: A solver for the multi-objective transshipment problem with facility location
description: scientific article; zbMATH DE number 1045750