MCFClass

swMATH5171MaRDI QIDQ17311FDOQ17311

Author name not available (Why is that?)

Official website: http://www.di.unipi.it/di/groups/optimize/Software/MCF.html

Described by source

• A computational study of cost reoptimization for min-cost flow problems

Cited In (14)

• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
• A computationally efficient method for nonparametric modeling of neural spiking activity with point processes
• A library for continuous convex separable quadratic knapsack problems
• PDNET
• RelaxIV
• RELAX4
• A theory and algorithms for combinatorial reoptimization
• A least-squares minimum-cost network flow algorithm
• Updating network flows given multiple, heterogeneous arc attribute changes
• Integer Programming and Combinatorial Optimization
• Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
• Prim-based support-graph preconditioners for min-cost flow problems
• An evolutionary algorithm for discrete tomography

This page was built for software: MCFClass