scientific article; zbMATH DE number 7453716

zbMath1480.90087MaRDI QIDQ5020878

I-Lin Wang

Publication date: 7 January 2022

Full work available at URL: http://www.orstw.org.tw/ijor/vol15no4/IJOR2018_vol15_no4_p155_p173.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programminginteger programmingnetwork optimizationmulticommodity

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (2)

Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints ⋮ Unnamed Item

Uses Software

• KORBX
• PPRN
• MINOS
• IPM
• OSL

Cites Work

• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Dual-ascent methods for large-scale multicommodity flow problems
• Multicoordination Methods for Solving Convex Block-Angular Programs
• Steepest Ascent for Large Scale Linear Programs
• Validation of subgradient optimization
• Faster approximation schemes for fractional multicommodity flow problems
• PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• An exponential‐function reduction method for block‐angular convex programs
• Coordination Complexity of Parallel Price-Directive Decomposition
• A parallel approximation algorithm for positive linear programming
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• A partitioning algorithm for the multicommodity network flow problem
• A generalized upper bounding algorithm for multicommodity network flow problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Minimal multicut and maximal integer multiflow: a survey
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Solving embedded generalized network problems
• Combinatorial approaches to multiflow problems
• Interior path following primal-dual algorithms. I: Linear programming
• The multicommodity assignment problem: A network aggregation heuristic
• Short proofs on multicommodity flows and cuts
• A natural randomization strategy for multicommodity flow and related algorithms
• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• An implementation of linear and nonlinear multicommodity network flows
• Minimum cost capacity installation for multicommodity network flows
• Multicommodity network flows: The impact of formulation on decomposition
• Solving binary cutting stock problems by column generation and branch- and-bound
• Minimum cost multiflows in undirected networks
• On some difficult linear programs coming from set partitioning
• Multicommodity network flow with jump constraints
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• Fast deterministic approximation for the multicommodity flow problem
• Multiflows and disjoint paths of minimum total cost
• A smooth penalty function algorithm for network-structured problems
• Potential function methods for approximately solving linear programming problems: theory and practice.
• A primal-dual algorithm for monotropic programming and its application to network optimization
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• The volume algorithm: Producing primal solutions with a subgradient method
• Adaptive game playing using multiplicative weights
• Fast approximation algorithms for multicommodity flow problems
• A heuristic solution procedure for multicommodity integer flows
• Speeding up Karmarkar's algorithm for multicommodity flows
• A sublinear-time randomized approximation algorithm for matrix games
• Gigaflops in linear programming
• A cutting plane algorithm for convex programming that uses analytic centers
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• A polyhedral approach to an integer multicommodity flow problem
• Primal partition programming for block diagonal matrices
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Scaling Algorithm for Multicommodity Flow Problems
• The simplex algorithm for multicommodity networks
• Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• Finding Minimum-Cost Circulations by Successive Approximation
• The maximum concurrent flow problem
• Finding minimum-cost circulations by canceling negative cycles
• A Parallel Projection for the Multicommodity Network Model
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• A unified framework for primal-dual methods in minimum cost network flow problems
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• A new approach to the maximum-flow problem
• Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• A polynomially bounded algorithm for a singly constrained quadratic program
• Single Commodity Representation of Multicommodity Networks
• On a parametric shortest path problem from primal—dual multicommodity network optimization
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• An Interior Point Method for Block Angular Optimization
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• Multicommodity Distribution System Design by Benders Decomposition
• The factorization approach to large-scale linear programming
• A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem
• A generalized upper bounding approach to a communications network planning problem
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Unimodular matrices of flow problems with additional constraints
• Graphic matroids and the multicommodity transportation problem
• Solving multicommodity transportation problems using a primal partitioning simplex technique
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• Large-scale linearly constrained optimization
• The simplex method for integral multicommodity networks
• On equivalent representations of certain multicommodity networks as single commodity flow problems
• Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
• Progress Made in Solving the Multicommodity Flow Problem
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• A computationally efficient method for nonlinear multicommodity network flow problems
• A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS
• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
• A new proximal decomposition algorithm for routing in telecommunication networks
• Integer multicommodity flow problems

This page was built for publication: