A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
From MaRDI portal
Publication:1306360
DOI10.1016/S0167-6377(99)00004-8zbMath0947.90017OpenAlexW1999527816WikidataQ127322883 ScholiaQ127322883MaRDI QIDQ1306360
Publication date: 19 December 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00004-8
Related Items
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Bilinear modeling solution approach for fixed charge network flow problems, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Combined column-and-row-generation for the optimal communication spanning tree problem, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, A biased random-key genetic algorithm for road congestion minimization, A heuristic method for the minimum toll booth problem, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs, Minimum‐cost flow problems having arc‐activation costs, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount, Solving fixed charge transportation problem with truck load constraint using metaheuristics, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Accelerating benders decomposition with heuristicmaster problem solutions, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Cost-based decision-making in middleware virtualization environments, Unnamed Item, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, Efficient heuristics for inventory placement in acyclic networks, COLE: a new heuristic approach for fixed charge problem computational results, Scheduled Service Network Design for Freight Rail Transportation, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Handbook of global optimization
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Fixed-cost transportation problems
- Some branch-and-bound procedures for fixed-cost transportation problems
- An approximative algorithm for the fixed-charges transportation problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- An approximative algorithm for the fixed charge problem
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Minimum cost routing for static network models
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
