Solving the convex cost integer dual network flow problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1342118
- Minimum Convex Cost Dynamic Network Flows
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- A parametric algorithm for convex cost network flow and related problems
- Solving integer minimum cost flows with separable convex cost objective polynomially
Cited in
(28)- Integer version of the multipath flow network synthesis problem
- The one-machine just-in-time scheduling problem with preemption
- Aggregation approach for the minimum binary cost tension problem
- New algorithms for convex cost tension problem with application to computer vision
- Grading prediction of enterprise financial crisis based on nonlinear programming evaluation: a case study of Chinese transportation industry
- The job shop scheduling problem with convex costs
- A capacity scaling algorithm for M-convex submodular flow
- Upper and lower degree-constrained graph orientation with minimum penalty
- Optimal deterministic and robust selection of electricity contracts
- A unified approach for a 1D generalized total variation problem
- Self-stabilizing local k-placement of replicas with local minimum variance
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- Complexity and algorithms for nonlinear optimization problems
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Hierarchical benders decomposition for open-pit mine block sequencing
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- scientific article; zbMATH DE number 1342118 (Why is no real title available?)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
- Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing
- An axiomatic distance methodology for aggregating multimodal evaluations
- Minimal-cost network flow problems with variable lower bounds on arc flows
- The pickup and delivery problem with time windows and scheduling on the edges
- The vehicle routing problem with flexible time windows and traveling times
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- Global optimization for first order Markov random fields with submodular priors
This page was built for publication: Solving the convex cost integer dual network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114859)
