NETGEN
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.
Keywords for this software
References in zbMATH (referenced in 147 articles , 1 standard article )
Showing results 1 to 20 of 147.
Sorted by year (- Bowly, Simon; Smith-Miles, Kate; Baatar, Davaatseren; Mittelmann, Hans: Generation techniques for linear programming instances with controllable properties (2020)
- Brown, Gerald G.; Carlyle, W. Matthew: Solving the nearly symmetric all-pairs shortest-path problem (2020)
- Moreno, Alfredo; Munari, Pedro; Alem, Douglas: A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (2019)
- Calvete, Herminia I.; del-Pozo, Lourdes; Iranzo, José A.: Dealing with residual energy when transmitting data in energy-constrained capacitated networks (2018)
- Grande, Enrico; Nicosia, Gaia; Pacifici, Andrea; Roselli, Vincenzo: An exact algorithm for a multicommodity min-cost flow over time problem (2018)
- Zhao, Yixin; Larsson, Torbjörn; Rönnberg, Elina; Pardalos, Panos M.: The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (2018)
- Zhou, Wei; Zhang, Cheng; Wang, Qiangqiang: Concealment measurement and flow distribution of military supply transportation: a double-entropy model (2018)
- Calvete, Herminia I.; del-Pozo, Lourdes; Iranzo, José A.: The energy-constrained quickest path problem (2017)
- Holzhauser, Michael; Krumke, Sven O.; Thielen, Clemens: A network simplex method for the budget-constrained minimum cost flow problem (2017)
- Di Puglia Pugliese, Luigi; Guerriero, Francesca: On the shortest path problem with negative cost cycles (2016)
- Maya Duque, Pablo A.; Dolinskaya, Irina S.; Sörensen, Kenneth: Network repair crew scheduling and routing for emergency relief distribution problem (2016)
- Moradi, Siamak; Raith, Andrea; Ehrgott, Matthias: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (2015)
- 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)
- Di Puglia Pugliese, Luigi; Guerriero, Francesca: Shortest path problem with forbidden paths: the elementary version (2013)
- Festa, P.; Guerriero, F.; Laganà, D.; Musmanno, R.: Solving the shortest path tour problem (2013)
- Hosseini, Seyed Ahmad: A model-based approach and analysis for multi-period networks (2013)
- Calvete, Herminia I.; Del-Pozo, Lourdes; Iranzo, José A.: Algorithms for the quickest path problem and the reliable quickest path problem (2012)
- Geranis, George; Paparrizos, Konstantinos; Sifaleras, Angelo: On a dual network exterior point simplex type algorithm and its computational behavior (2012)
- Çalışkan, Cenk: A specialized network simplex algorithm for the constrained maximum flow problem (2011)
- Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; Johnson, Ellis L.; Sokol, Joel S.: A least-squares minimum-cost network flow algorithm (2011)