Solving the facility location and fixed charge solid transportation problem
From MaRDI portal
Publication:1983711
DOI10.3934/jimo.2020034zbMath1476.90053OpenAlexW3007481928MaRDI QIDQ1983711
Gbeminiyi John Oyewole, Olufemi Adetunji
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020034
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- A heuristic for BILP problems: the single source capacitated facility location problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Cutting planes for integer programs with general integer variables
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- A solid transportation model with product blending and parameters as rough variables
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- Capacitated Facility Location Problem in random fuzzy environment: Using (α ,β)-cost minimization model under the Hurwicz criterion
- Efficient solution of large scale, single-source, capacitated plant location problems
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- New Methods in Mathematical Programming—The Solid Transportation Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
This page was built for publication: Solving the facility location and fixed charge solid transportation problem
