scientific article
From MaRDI portal
Publication:2743974
zbMath0968.90515MaRDI QIDQ2743974
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ How to compute least infeasible flows ⋮ A strongly polynomial algorithm for the uniform balanced network flow problem ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ Generalized max flows and augmenting paths ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ An inverse model for the most uniform problem ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ A submodular optimization problem with side constraints ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm ⋮ Minimax inverse problems of minimum cuts ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem ⋮ The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case ⋮ A strongly polynomial simplex method for the linear fractional assignment problem ⋮ A fast bipartite network flow algorithm for selective assembly
