A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
type: Item
instance of: scholarly article
title: A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
zbMATH Open document ID: 1487.90641
author: Jordi Castro
author: Stefano Nasini
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/351220
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7355301
zbMATH Keywords: large-scale optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: minimum cost flow problems
zbMATH Keywords: preconditioned conjugate gradient
describes a project that uses: CPLEX
describes a project that uses: LEMON
describes a project that uses: DIMACS
describes a project that uses: IPM
MaRDI profile type: Publication
OpenAlex ID: W2921632820
cites work: Q3056948
cites work: Q4845363
cites work: A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
cites work: Preconditioning indefinite systems in interior point methods for optimization
cites work: A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
cites work: Clustering-based preconditioning for stochastic programs
cites work: A Specialized Interior-Point Algorithm for Multicommodity Network Flows
cites work: Interior-point solver for convex separable block-angular problems
cites work: Quadratic regularizations in an interior-point method for primal block-angular problems
cites work: On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems
cites work: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
cites work: An adaptive augmented Lagrangian method for large-scale constrained optimization
cites work: New Preconditioners for KKT Systems of Network Flow Problems
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: Convergence analysis of an inexact feasible interior point method for convex quadratic programming
cites work: Collaborative transportation with overlapping coalitions
cites work: Convergence behavior of interior-point algorithms
cites work: Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
cites work: Q4276004
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: Minimum-cost flow algorithms: an experimental evaluation
cites work: An integrated planning model in centralized power systems
cites work: Matching is as easy as matrix inversion
cites work: Testing of a large-scale network optimization program
cites work: Introductory lectures on convex optimization. A basic course.
cites work: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
cites work: A polynomial time primal network simplex algorithm for minimum cost flows
cites work: An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
cites work: Minimum Concave Cost Flows in Certain Networks
DOI: 10.1016/J.EJOR.2020.10.027
Recommended article: A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Recommended article: INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
Recommended article: A combinatorial interior point method for network flow problems
Recommended article: Combinatorial interior point methods for generalized network flow problems
Recommended article: Q4283447
Recommended article: A Simple Efficient Interior Point Method for Min-Cost Flow
Recommended article: A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
Recommended article: A parametric algorithm for convex cost network flow and related problems
Recommended article: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Recommended article: The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems
description: scientific article; zbMATH DE number 7355301