Pages that link to "Item:Q2743974"
From MaRDI portal
The following pages link to Parametric flows, weighted means of cuts, and fractional combinatorial optimization (Q2743974):
Displaying 26 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem (Q2029281) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Hitting a path: a generalization of weighted connectivity via game theory (Q2424795) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Bottleneck capacity expansion problems with general budget constraints (Q2765595) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- A submodular optimization problem with side constraints (Q4645927) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- Generalized max flows and augmenting paths (Q5101415) (← links)
- The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (Q5449665) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
