Combinatorial algorithms for inverse network flow problems
From MaRDI portal
Recommendations
Cited in
(54)- Some inverse optimization problems on network
- The inverse connected p-median problem on block graphs under various cost functions
- Complexity of partial inverse assignment problem and partial inverse cut problem
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Discussion on the inverse dynamic minimum cost path problem under \(L_1\) norm
- Inverse Optimization
- Combinatorial Algorithms for the Generalized Circulation Problem
- Inverse optimization problems with multiple weight functions
- Inverse problems and solution methods for a class of nonlinear complementarity problems
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- Inverse optimization in semi-definite programs to impute unknown constraint matrices
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Inverse eccentric vertex problem on networks
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- The minmax regret inverse maximum weight problem
- A solution to the inverse minimum cut problem in dynamic network flows
- Inverse quadratic programming problem with \(l_1\) norm measure
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- Inverse Nonlinear Multicommodity Flow Optimization by Column Generation
- Combinatorial approaches to multiflow problems
- Inverse Bottleneck Optimization Problems on Networks
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- Combinatorial acyclicity models for potential‐based flows
- Inverse optimization for linearly constrained convex separable programming problems
- An enhanced Benders decomposition method for unique shortest path routing
- Weighted inverse minimum cut problem under the sum-type Hamming distance
- Inverse minimum flow problem
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- scientific article; zbMATH DE number 1484312 (Why is no real title available?)
- Inverse maximum flow problems under the combining norms
- Robust partial inverse network flow problems
- An inverse optimization approach for a capacitated vehicle routing problem
- A majorized penalty approach to inverse linear second order cone programming problems
- Minimax inverse problems of minimum cuts
- The inverse maximum dynamic flow problem
- A perturbation approach for a type of inverse linear programming problems
- A perturbation approach for an inverse quadratic programming problem
- Representing inverses in pure network flow optimization
- The inverse maximum flow problem consideringl∞norm
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Reverse maximum flow problem under the weighted Chebyshev distance
- Capacity inverse minimum cost flow problem
- Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
- Inverse optimization in high-speed networks
- Inverse optimization in minimum cost flow problems on countably infinite networks
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
- Partial inverse assignment problems under \(l_{1}\) norm
This page was built for publication: Combinatorial algorithms for inverse network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798190)
