A branch-and-bound algorithm for the transportation problem with location of p transshipment points
From MaRDI portal
Publication:1362973
DOI10.1016/S0305-0548(96)00078-0zbMATH Open0882.90032OpenAlexW2038770643MaRDI QIDQ1362973FDOQ1362973
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
Recommendations
- scientific article; zbMATH DE number 3847213
- Some branch-and-bound procedures for fixed-cost transportation problems
- A branch and bound procedure for cost minimizing bulk transportation problem
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- An exact and a heuristic approach for the transportation-\(p\)-facility location problem
- scientific article; zbMATH DE number 912072
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- A solver for the multi-objective transshipment problem with facility location
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Multicommodity Distribution System Design by Benders Decomposition
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A Plant and Warehouse Location Problem
- The multi-level uncapacitated facility location problem is not submodular
- 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
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Uncapacitated facility location: General solution procedure and computational experience
- A Warehouse-Location Problem
- Title not available (Why is that?)
- Lagrangean decomposition for integer programming : theory and applications
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- Title not available (Why is that?)
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- A cost operator approach to multistage location-allocation
- Title not available (Why is that?)
- Site Location via Mixed-integer Programming
- Title not available (Why is that?)
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- A branch-and-bound method for multicommodity location with balancing requirements
- Models for multimode multicommodity location problems with interdepot balancing requirements
- The return plant location problem: Modelling and resolution
- A branch-and-bound algorithm for depot location and container fleet management
Cited In (7)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
Uses Software
This page was built for publication: A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362973)
