RELAX4 is a solver for minimum cost flow problems that combines the RELAX code (see two papers by Bertsekas and Tseng (1988)) with an initialization based on an auction/sequential shortest path algorithm. This initialization is shown to be extremely helpful in speeding up the solution of difficult problems, involving for example long augmenting paths, for which the relaxation method has been known to be slow. On the other hand, this initialization procedure does not significantly deteriorate the performance of the relaxation method for the types of problems where it has been known to be very fast.

References in zbMATH (referenced in 36 articles )

Showing results 1 to 20 of 36.
Sorted by year (citations)

1 2 next

  1. Meyr, Herbert; Mann, Matthias: A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (2013)
  2. Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; Johnson, Ellis L.; Sokol, Joel S.: A least-squares minimum-cost network flow algorithm (2011)
  3. Zhu, Xiaoyan; Yuan, Qi; Garcia-Diaz, Alberto; Dong, Liang: Minimal-cost network flow problems with variable lower bounds on arc flows (2011)
  4. Miller-Hooks, Elise; Tang, Hao; Chen, Zhiying: Updating network flows given multiple, heterogeneous arc attribute changes (2010)
  5. Restrepo, Mateo; Williamson, David P.: A simple GAP-canceling algorithm for the generalized maximum flow problem (2009)
  6. Batenburg, K.J.: Network flow algorithms for discrete tomography (2007)
  7. Batenburg, Kees Joost: A network flow algorithm for binary image reconstruction from few projections (2006)
  8. Rangaraj, Narayan; Sohoni, Milind; Puniya, Prashant; Garg, Jugal: Rake linking for suburban train services (2006)
  9. Hansen, Ben B.: Full matching in an observational study of coaching for the sat (2004)
  10. Meyr, Herbert: Simultaneous lotsizing and scheduling on parallel machines (2002)
  11. Sterbin Gottlieb, Elsie: Solving generalized transportation problems via pure transportation problems (2002)
  12. Lozano, S.; Adenso-Díaz, B.; Eguia, I.; Onieva, L.: A one-step tabu search algorithm for manufacturing cell design (1999)
  13. Beraldi, P.; Guerriero, F.; Musmanno, R.: Efficient parallel algorithms for the minimum cost flow problem (1997)
  14. Curet, Norman D.: Applying steepest-edge techniques to a network primal-dual algorithm (1997)
  15. Hindi, K.S.: Solving the CLSP by a tabu search heuristic (1996)
  16. Resende, Mauricio G.C.; Pardalos, Panos M.: Interior point algorithms for network flow problems (1996)
  17. Bertsekas, D.P.: An auction algorithm for the max-flow problem (1995)
  18. Hindi, K.S.: Efficient solution of the single-item, capacitated lot-sizing problem with start-up and reservation costs (1995)
  19. Hindi, K.S.: Algorithms for capacitated, multi-item lot-sizing without set-ups (1995)
  20. Curet, Norman D.: An incremental primal-dual method for generalized networks (1994)

1 2 next