Pages that link to "Item:Q4798190"
From MaRDI portal
The following pages link to Combinatorial algorithms for inverse network flow problems (Q4798190):
Displaying 50 items.
- Inverse eccentric vertex problem on networks (Q301951) (← links)
- Some inverse optimization problems on network (Q394471) (← links)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- The inverse maximum dynamic flow problem (Q625882) (← links)
- The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← links)
- An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- Inverse polymatroidal flow problem (Q1304389) (← links)
- Solution structure of some inverse combinatorial optimization problems (Q1304391) (← links)
- Inverse optimization in high-speed networks (Q1399112) (← links)
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm (Q1598883) (← links)
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
- Calculating some inverse linear programming problems (Q1923457) (← links)
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure (Q1987439) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- Inverse quadratic programming problem with \(l_1\) norm measure (Q2244221) (← links)
- Capacity inverse minimum cost flow problem (Q2268762) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- A majorized penalty approach to inverse linear second order cone programming problems (Q2438414) (← links)
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305) (← links)
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems (Q2515287) (← links)
- Partial inverse assignment problems under \(l_{1}\) norm (Q2643813) (← links)
- Complexity of partial inverse assignment problem and partial inverse cut problem (Q2765604) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- The inverse maximum flow problem considering<i>l</i><sub>∞</sub>norm (Q3598045) (← links)
- Inverse Optimization (Q3635034) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Inverse Nonlinear Multicommodity Flow Optimization by Column Generation (Q4653554) (← links)
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Inverse optimization in minimum cost flow problems on countably infinite networks (Q5226170) (← links)
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems (Q5384603) (← links)
- A perturbation approach for a type of inverse linear programming problems (Q5391505) (← links)
- Robust partial inverse network flow problems (Q5943384) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- A penalty-type method for solving inverse optimal value problem in second-order conic programming (Q6546899) (← links)
- An enhanced Benders decomposition method for unique shortest path routing (Q6613945) (← links)
