Network Reoptimization Algorithms: A Statistically Designed Comparison
From MaRDI portal
Publication:4282271
DOI10.1287/ijoc.5.4.395zbMath0800.90755OpenAlexW2014411196MaRDI QIDQ4282271
Mohammad M. Amini, Richard S. Barr
Publication date: 24 March 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.5.4.395
Related Items (6)
Designing and reporting on computational experiments with heuristic methods ⋮ Three approximation algorithms for solving the generalized segregated storage problem. ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Testing cut generators for mixed-integer linear programming ⋮ Algorithms for network piecewise-linear programs: A comparative study ⋮ Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
This page was built for publication: Network Reoptimization Algorithms: A Statistically Designed Comparison
