Minimum concave-cost network flow problems: Applications, complexity, and algorithms
From MaRDI portal
Publication:2277131
DOI10.1007/BF02283688zbMath0724.90022OpenAlexW1968119063MaRDI QIDQ2277131
Panos M. Pardalos, G. M. Guisewite
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02283688
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Deterministic network models in operations research (90B10)
Related Items
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Bilinear modeling solution approach for fixed charge network flow problems, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, Approximation algorithms for general one-warehouse multi-retailer systems, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Resource downgrading, Minimizing a linear multiplicative-type function under network flow constraints, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Strategic design of distribution systems with economies of scale in transportation, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, A model for optimization of transport infrastructure for some homogeneous goods markets, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, Optimization of an energy market transportation system, A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes, Solving biobjective network flow problem associated with minimum cost-time loading, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, Energy markets: optimization of transmission networks, Avoiding unnecessary demerging and remerging of multi‐commodity integer flows, Two classical transportation problems revisited: pure constant fixed charges and the paradox, A general purpose exact solution method for mixed integer concave minimization problems, On solving continuous-time dynamic network flows, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, A dynamic programming approach for the pipe network layout problem, An improved branch and bound algorithm for minimum concave cost network flow problems, Open questions in complexity theory for numerical optimization, Global search algorithms for minimum concave-cost network flow problems, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Strongly polynomial algorithm for a production-transportation problem with concave production cost, Complexity and algorithms for nonlinear optimization problems, Complexity analysis for maximum flow problems with arc reversals, Unnamed Item, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, On the computational power of molecular heat engines, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, The plant location and flexible technology acquisition problem., A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, An integrated model for facility location and technology acquisition, Subdeterminants and Concave Integer Quadratic Programming, Valid inequalities for separable concave constraints with indicator variables, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences, Minimum concave cost flow over a grid network, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Parallel computing in nonconvex programming, On budget-constrained flow improvement., Strongly polynomial algorithm for two special minimum concave cost network flow problems, Network cost minimization using threshold-based discounting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- Some branch and bound techniques for nonlinear optimization
- Enumerative techniques for solving some nonconvex global optimization problems
- Checking local optimality in constrained quadratic programming is NP- hard
- Minimum concave cost production system: A further generalization of multi-echelon model
- A parallel algorithm for constrained concave quadratic global minimization
- An algorithm for the min concave cost flow problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimal universal covers in \(E^ n\)
- On a Class of Capacitated Transportation Problems
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Fixed-cost transportation problems
- Some branch-and-bound procedures for fixed-cost transportation problems
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
- Hard Enumeration Problems in Geometry and Combinatorics
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Nonlinear cost network models in transportation analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Minimizing a sum of staircase functions under linear constraints
- A Dynamic Lot-Size Model with Make-or-Buy Decisions
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Graphical Interpretation of the Transportation Problem
- A composite algorithm for a concave-cost network flow problem
- Analysis of a flow problem with fixed charges
- An approximative algorithm for the fixed-charges transportation problem
- New Methods in Mathematical Programming—The Solid Transportation Problem
- Adjacent extreme flows and application to min concave cost flow problems
- Deterministic Production Planning: Algorithms and Complexity
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Indefinite Quadratic Solid Transportation Problem
- Convergent Algorithms for Minimizing a Concave Function
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Capacity Expansion with Two Producing Regions and Concave Costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Using shortest paths in some transshipment problems with concave costs
- On building minimum cost communication networks
- Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model
- Optimal Facility Location with Concave Costs
- On building minimum cost communication networks over time
- Concave minimization over a convex polyhedron
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- An approximate solution method for the fixed charge problem
- Minimum Concave Cost Flows in Certain Networks
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An Algorithm for Separable Nonconvex Programming Problems
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Optimal Inventory Policy with Multiple Set-Up Costs
- An approximative algorithm for the fixed charge problem
- A branch‐bound algorithm for the capacitated facilities location problem
- An Analysis of Private and Public Sector Location Models
- Production Smoothing of Economic Lot Sizes with Non-Decreasing Requirements
- Smoothing Start-Up and Shut-Down Costs: Concave Case
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Minimum cost routing for static network models
- A Facilities in Series Inventory Model with Nested Schedules
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
