Pages that link to "Item:Q1889860"
From MaRDI portal
The following pages link to A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860):
Displaying 15 items.
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859) (← links)
- A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
- (Q4998944) (← links)
- Canceling most helpful total cuts for minimum cost network flow (Q5285477) (← links)
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784) (← links)
- Applications and efficient algorithms for integer programming problems on monotone constraints (Q6087067) (← links)
