Multicommodity Distribution System Design by Benders Decomposition
From MaRDI portal
Publication:4060779
DOI10.1287/MNSC.20.5.822zbMath0304.90122OpenAlexW4250535541MaRDI QIDQ4060779
Glenn W. Graves, A. M. Geoffrion
Publication date: 1974
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.20.5.822
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)
Related Items (only showing first 100 items - show all)
A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors ⋮ Implementing Automatic Benders Decomposition in a Modern MIP Solver ⋮ A Lagrangian heuristic for the capacitated plant location problem with single source constraints ⋮ A cross decomposition algorithm for a multiproduct-multitype facility location problem ⋮ Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly ⋮ A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ Stochastic Planning and Scheduling with Logic-Based Benders Decomposition ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ Supply–demand hub in industrial clusters: a stochastic approach ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Unnamed Item ⋮ An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints ⋮ Parametric methods in integer linear programming ⋮ An integrated plant loading model with economies of scale and scope ⋮ A continuous DC programming approach to the strategic supply chain design problem from qualified partner set ⋮ Designing optimal global supply chains at Dow AgroSciences ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ A direct dual method for the mixed plant location problem with some side constraints ⋮ Modeling and heuristics for production time crashing in supply chain network design ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ A New Scenario Reduction Method Based on Higher-Order Moments ⋮ Incorporating cellular manufacturing into supply chain design ⋮ Exact First-Choice Product Line Optimization ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ On generating maximal nondominated Benders cuts ⋮ An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions ⋮ A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture ⋮ Optimal engineering design via Benders' decomposition ⋮ Estimating the parameters of a fatigue model using Benders' decomposition ⋮ A branch and bound algorithm for the generalized assignment problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Benders Dual Decomposition Method ⋮ Mitigating Interdiction Risk with Fortification ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ A continuous approximation procedure for determining inventory distribution schemas within supply chains ⋮ Dynamic-demand capacitated facility location problems with and without relocation ⋮ Networks synthesis and optimum network design problems: Models, solution methods and applications ⋮ On a class of assignment problems. ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Solving the optimum communication spanning tree problem ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation ⋮ A study on the optimal inventory allocation for clinical trial supply chains ⋮ Multi-level facility location problems ⋮ An application of interdependent lot size and consolidation point choice ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Scheduling medical residents' training at university hospitals ⋮ Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand ⋮ A class of multi-objective supply chain networks optimal model under random fuzzy environment and its application to the industry of Chinese liquor ⋮ A genetic algorithm for solving the fixed-charge transportation model: two-stage problem ⋮ A hierarchical solution approach for a multicommodity distribution problem under a special cost structure ⋮ An algorithm for the capacitated, multi-commodity multi-period facility location problem. ⋮ A stochastic programming approach for supply chain network design under uncertainty ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ The zero pivot phenomenon in transportation and assignment problems and its computational implications ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Model for integrating the supply chain of an appliance company: a value of information approach ⋮ Planning and coordination of production and distribution facilities for multiple commodities ⋮ A probabilistic analysis of the multi-period single-sourcing problem ⋮ Designing a two-echelon distribution network under demand uncertainty ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Emerging trends in large-scale supply chain management ⋮ Network design for reverse and closed‐loop supply chains: An annotated bibliography of models and solution approaches ⋮ A performance guarantee heuristic for electronic components placement problems including thermal effects ⋮ COAL: A new heuristic approach for solving the fixed charge problem - computational results ⋮ The plant location and flexible technology acquisition problem. ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ Benders decomposition: solving binary master problems by enumeration ⋮ Simultaneous configuration of platform products and manufacturing supply chains ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ A genetic algorithm for two-stage transportation problem using priority-based encoding ⋮ Simultaneous fleet assignment and cargo routing using Benders decomposition ⋮ Multicommodity network flows—A survey ⋮ Design of a distribution network using primal-dual decomposition ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Integrated production/distribution planning in supply chains: An invited review ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ A demand-shifting feasibility algorithm for Benders decomposition. ⋮ A multi-level approach for network design of integrated supply chains ⋮ A multi-stage supply chain network design problem with in-house production and partial product outsourcing ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing ⋮ Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics ⋮ The simple plant location problem: Survey and synthesis ⋮ A property of assignment type mixed integer linear programming problems ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ A continuous model for production-distribution system design ⋮ Mixed-integer quadratic programming ⋮ Uncapacitated and Capacitated Facility Location Problems ⋮ A multi-phase mathematical programming approach for effective supply chain design ⋮ An optimization model for selecting a product family and designing its supply chain ⋮ Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms ⋮ Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network ⋮ Breakable fuzzy multi-stage transportation problem
This page was built for publication: Multicommodity Distribution System Design by Benders Decomposition