scientific article

Publication date: 1984

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

linear constraints combinatorial structures pivoting algorithms monotropic optimization matroidal structures optimization of flows and potentials in networks paths and cuts preseparable convex function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (only showing first 100 items - show all)

A simplex algorithm for piecewise-linear programming I: Derivation and proof ⋮ An approach for the convex feasibility problem via monotropic programming ⋮ Constrained flow control in storage networks: capacity maximization and balancing ⋮ A simplex-like method with bisection for linear programming¹ ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems ⋮ Local optimality conditions for multicommodity flow problems with separable piecewise convex costs ⋮ The role of pivoting in proving some fundamental theorems of linear algebra ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Basis characterisation for linear multicommodity network programs ⋮ Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems ⋮ Piecewise-linear programming: The compact (CPLP) algorithm ⋮ A faster strongly polynomial time algorithm to solve the minimum cost tension problem ⋮ A decomposition method for solving multicommodity network equilibria ⋮ Combinatorial acyclicity models for potential‐based flows ⋮ Convex duality in nonlinear optimal transport ⋮ A geometric approach to nonsmooth optimization with sample applications ⋮ A piecewise linear upper bound on the network recourse function ⋮ An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem ⋮ Duality in Countably Infinite Monotropic Programs ⋮ Relaxation methods for problems with strictly convex separable costs and linear constraints ⋮ On the robustness of potential-based flow networks ⋮ Morphisms for resistive electrical networks ⋮ Evenly convex sets, and evenly quasiconvex functions, revisited ⋮ Investing in arcs in a network to maximize the expected max flow ⋮ On node constraint networks ⋮ A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows ⋮ Unnamed Item ⋮ Transporting and Mixing Gasses with Different Qualities ⋮ Transporting and Mixing Gasses with Different Qualities ⋮ Edge-matching graph contractions and their interlacing properties ⋮ Duality for extended infinite monotropic optimization problems ⋮ Networks and Stability ⋮ A dual scheme for traffic assignment problems ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ Analytic efficient solution set for bi-criteria quadratic network programs ⋮ Optimality conditions for maximizing a function over a polyhedron ⋮ Solving the undirected minimum cost flow problem with arbitrary costs ⋮ Tracing the characteristic curve of a quadratic black box ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ THE LOGIC OF PARTITIONS: INTRODUCTION TO THE DUAL OF THE LOGIC OF SUBSETS ⋮ Unnamed Item ⋮ Timetabling with passenger routing ⋮ Generation of classes of robust periodic railway timetables ⋮ A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks ⋮ Inversion of real-valued functions and applications ⋮ The simplex algorithm for multicommodity networks ⋮ Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming ⋮ Robust control strategies for multi--inventory systems with average flow constraints ⋮ Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion ⋮ An exact algorithm for the min-cost network containment problem ⋮ Support prices of activities in linear programming¹,² ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ Substitutes and complements in network flows viewed as discrete convexity ⋮ Unnamed Item ⋮ A unified framework for primal-dual methods in minimum cost network flow problems ⋮ Data parallel computing for network-structured optimization problems ⋮ Variable demand and multi-commodity flow in Markovian network equilibrium ⋮ A decomposition approach for a resource constrained scheduling problem ⋮ A generator and a simplex solver for network piecewise linear programs ⋮ Quadratic M-convex and L-convex functions ⋮ On the equivalence of constrained and unconstrained flows ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ A faster version of the ASG algorithm ⋮ Polynomial-time identification of robust network flows under uncertain arc failures ⋮ Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere ⋮ A Z-simplex algorithm with partial updates ⋮ Finite method for a nonlinear allocation problem ⋮ Linearly constrained convex programming as unconstrained differentiable concave programming ⋮ A strongly polynomial algorithm for the minimum cost tension problem ⋮ Single-projection procedure for linear optimization ⋮ Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems ⋮ Discrete optimization in public rail transport ⋮ A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy ⋮ Sublinear upper bounds for stochastic programs with recourse ⋮ Dual coordinate step methods for linear network flow problems ⋮ Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm ⋮ Optimal scaling of a gradient method for distributed resource allocation ⋮ Asynchronous gradient algorithms for a class of convex separable network flow problems ⋮ Geometric interpretation of the optimality conditions in multifacility location and applications ⋮ Network games; adaptations to Nash-Cournot equilibrium ⋮ Feasibility in uncapacitated networks: The effect of individual arcs and nodes ⋮ Restricted recourse strategies for bounding the expected network recourse function ⋮ Feasibility in capacitated networks: The effect of individual arcs and nodes ⋮ On a zero duality gap result in extended monotropic programming ⋮ Potential games with incomplete preferences ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Introduction to shape stability for a storage model ⋮ Canonical bases in linear programming ⋮ Relaxation methods for monotropic programs ⋮ Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem ⋮ Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. ⋮ The auction algorithm for the transportation problem ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ Duality and network theory in passivity-based cooperative control ⋮ Guaranteed cost control for multi-inventory systems with uncertain demand. ⋮ An algorithm for solving quadratic network flow problems

This page was built for publication: