Network Reoptimization Algorithms: A Statistically Designed Comparison

DOI10.1287/IJOC.5.4.395MaRDI QIDQ4282271zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited in

(6)

• Testing cut generators for mixed-integer linear programming
• Designing and reporting on computational experiments with heuristic methods
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
• Updating network flows given multiple, heterogeneous arc attribute changes
• Algorithms for network piecewise-linear programs: A comparative study
• Three approximation algorithms for solving the generalized segregated storage problem.

This page was built for publication: Network Reoptimization Algorithms: A Statistically Designed Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282271)