The following pages link to MCFClass (Q17311):
Displaying 11 items.
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- Updating network flows given multiple, heterogeneous arc attribute changes (Q655194) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← links)
- A library for continuous convex separable quadratic knapsack problems (Q2355800) (← links)
- An evolutionary algorithm for discrete tomography (Q2573237) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- A Computationally Efficient Method for Nonparametric Modeling of Neural Spiking Activity with Point Processes (Q3583488) (← links)
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638) (← links)
- Integer Programming and Combinatorial Optimization (Q5712450) (← links)
