Minimal-cost network flow problems with variable lower bounds on arc flows

DOI10.1016/J.COR.2010.11.006zbMath1208.90031OpenAlexW2090539371MaRDI QIDQ632657

Juan-Miguel Gracia

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.006

zbMATH Keywords

network optimizationgeneralized networkminimal cost network flowvariable lower bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (5)

A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Minimum cost flows with minimum quantities ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project ⋮ Complexity and approximability of the maximum flow problem with minimum quantities ⋮ The generalized assignment problem with minimum quantities

Uses Software

• CPLEX
• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Application of fuzzy minimum cost flow problems to network design under uncertainty
• Fuzzy multi-level minimum cost flow problems
• Finding minimum-cost flows by double scaling
• Solving to optimality the uncapacitated fixed-charge network flow problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• Tabu search applied to the general fixed charge problem
• Supply chain optimization.
• A polynomial combinatorial algorithm for generalized minimum cost flow
• Solving the Convex Cost Integer Dual Network Flow Problem
• Using mathematical programming heuristics in a multicriteria network flow context
• Some branch-and-bound procedures for fixed-cost transportation problems
• Minimum Convex Cost Dynamic Network Flows
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Primal Algorithm to Solve Network Flow Problems with Convex Costs
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Pivot Strategies for Primal-Simplex Network Codes
• New formulation and relaxation to solve a concave-cost network flow problem
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Minimum Concave Cost Flows in Certain Networks
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Cost Minimization in Networks with Discrete Stochastic Requirements
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem

This page was built for publication: Minimal-cost network flow problems with variable lower bounds on arc flows