A branch-and-bound algorithm for the transportation problem with location of p transshipment points
From MaRDI portal
(Redirected from Publication:1362973)
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
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- scientific article; zbMATH DE number 1253065 (Why is no real title available?)
- scientific article; zbMATH DE number 711782 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- A Plant and Warehouse Location Problem
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- A branch-and-bound algorithm for depot location and container fleet management
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A branch-and-bound method for multicommodity location with balancing requirements
- A cost operator approach to multistage location-allocation
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A warehouse-location problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Lagrangean decomposition for integer programming : theory and applications
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Multicommodity Distribution System Design by Benders Decomposition
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Site Location via Mixed-integer Programming
- The multi-level uncapacitated facility location problem is not submodular
- The return plant location problem: Modelling and resolution
- Uncapacitated facility location: General solution procedure and computational experience
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
- scientific article; zbMATH DE number 140518 (Why is no real title available?)
- scientific article; zbMATH DE number 912072 (Why is no real title available?)
- An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
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)
