Cited in
(52)- Reverse Auction and the Solution of Inequality Constrained Assignment Problems
- Min-Cost Flow in Unit-Capacity Planar Graphs
- A one-step tabu search algorithm for manufacturing cell design
- Applying steepest-edge techniques to a network primal-dual algorithm
- Minimal-cost network flow problems with variable lower bounds on arc flows
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- An incremental primal-dual method for generalized networks
- Dual coordinate step methods for linear network flow problems
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Rake linking for suburban train services
- Network DEA-based biobjective optimization of product flows in a supply chain
- Multiscale strategies for computing optimal transport
- scientific article; zbMATH DE number 515932 (Why is no real title available?)
- PDNET
- MCFClass
- RelaxIV
- NETGEN
- sensitivitymv
- SAP APO
- sensitivitymw
- stratamatch
- XMP
- estCI
- Solving the CLSP by a Tabu Search Heuristic
- Parallel primal-dual methods for the minimum cost flow problem
- MultiScaleOT
- Network flow algorithms for discrete tomography
- Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- The auction algorithm for the transportation problem
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
- Simultaneous lotsizing and scheduling on parallel machines
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- A generic auction algorithm for the minimum cost network flow problem
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Relaxation methods for monotropic programs
- A survey of dynamic network flows
- A least-squares minimum-cost network flow algorithm
- scientific article; zbMATH DE number 711782 (Why is no real title available?)
- Updating network flows given multiple, heterogeneous arc attribute changes
- An \(\epsilon\)-relaxation method for generalized separable convex cost network flow problems
- On the dual coordinate ascent approach for nonlinear networks
- scientific article; zbMATH DE number 1064584 (Why is no real title available?)
- Full Matching in an Observational Study of Coaching for the SAT
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
- Efficient parallel algorithms for the minimum cost flow problem
- An auction algorithm for the max-flow problem
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- The auction algorithm: A distributed relaxation method for the assignment problem
- Solving generalized transportation problems via pure transportation problems
This page was built for software: RELAX4
