NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. The purpose of this paper is to describe the development, implementation, and availability of a computer program for generating a variety of feasible network problems together with a set of benchmarked problems derived from it. The code “NETGEN” can generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems. In addition to generating structurally different classes of network problems the code permits the user to vary structural characteristics within a class. Problems benchmarked on several codes currently available are provided in this paper since NETGEN will also allow other researchers to generate identical problems. In particular, the latter part of the paper contains the solution time and objective function value of 40 assignment, transportation, and network problems varying in size from 200 nodes to 8,000 nodes and from 1,300 arcs to 35,000 arcs.

References in zbMATH (referenced in 132 articles , 1 standard article )

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

1 2 3 ... 5 6 7 next

  1. Di Puglia Pugliese, Luigi; Guerriero, Francesca: On the shortest path problem with negative cost cycles (2016)
  2. Silva, Ricardo M.A.; Silva, Diego M.; Resende, Mauricio G.C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (2014)
  3. Di Puglia Pugliese, Luigi; Guerriero, Francesca: Shortest path problem with forbidden paths: the elementary version (2013)
  4. Festa, P.; Guerriero, F.; Laganà, D.; Musmanno, R.: Solving the shortest path tour problem (2013)
  5. Hosseini, Seyed Ahmad: A model-based approach and analysis for multi-period networks (2013)
  6. Calvete, Herminia I.; Del-Pozo, Lourdes; Iranzo, José A.: Algorithms for the quickest path problem and the reliable quickest path problem (2012)
  7. Geranis, George; Paparrizos, Konstantinos; Sifaleras, Angelo: On a dual network exterior point simplex type algorithm and its computational behavior (2012)
  8. Çalışkan, Cenk: A specialized network simplex algorithm for the constrained maximum flow problem (2011)
  9. Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; Johnson, Ellis L.; Sokol, Joel S.: A least-squares minimum-cost network flow algorithm (2011)
  10. Güler, Çiğdem; Hamacher, Horst W.: Capacity inverse minimum cost flow problem (2010)
  11. Li, X-Y; Aneja, Y.P.; Baki, F.: An ant colony optimization metaheuristic for single-path multicommodity network flow problems (2010)
  12. Bessas, Apostolos; Zaroliagis, Christos: On assessing robustness in transportation planning (2009)
  13. Cerulli, R.; Gentili, M.; Iossa, A.: Bounded-degree spanning tree problems: models and new algorithms (2009)
  14. Eusébio, Augusto; Figueira, José Rui: Finding non-dominated solutions in bi-objective integer network flow problems (2009)
  15. Eusébio, Augusto; Figueira, José Rui; Ehrgott, Matthias: A primal-dual simplex algorithm for bi-objective network flow problems (2009)
  16. Fourer, R.; Gassmann, H.I.; Ma, J.; Martin, R.K.: An XML-based schema for stochastic programs (2009)
  17. Fourer, R.; Gassmann, H.I.; Ma, J.; Martin, R.K.: An XML-based schema for stochastic programs (2009)
  18. Jane, Chin-Chia; Shen, Wu-Hsien; Laih, Yih-Wenn: Practical sequential bounds for approximating two-terminal reliability (2009)
  19. Raith, Andrea; Ehrgott, Matthias: A two-phase algorithm for the biobjective integer minimum cost flow problem (2009)
  20. Restrepo, Mateo; Williamson, David P.: A simple GAP-canceling algorithm for the generalized maximum flow problem (2009)

1 2 3 ... 5 6 7 next