Pages that link to "Item:Q3114859"
From MaRDI portal
The following pages link to Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859):
Displayed 24 items.
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822) (← links)
- Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- Aggregation approach for the minimum binary cost tension problem (Q1015014) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Grading prediction of enterprise financial crisis based on nonlinear programming evaluation: a case study of Chinese transportation industry (Q1723711) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
- A unified approach for a 1D generalized total variation problem (Q2149555) (← links)
- Self-stabilizing local \(k\)-placement of replicas with local minimum variance (Q2354401) (← links)
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
- Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing (Q2830758) (← links)
- A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
- Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing (Q5131538) (← links)
- An axiomatic distance methodology for aggregating multimodal evaluations (Q6199498) (← links)