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 10 items.
- 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)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)