Enhanced instance space analysis for the maximum flow problem

DOI10.1016/j.ejor.2022.04.012OpenAlexW4223970124WikidataQ114184278 ScholiaQ114184278MaRDI QIDQ2171589

Hossein Alipour, Mario Andrés Muñoz, Kate A. Smith-Miles

Publication date: 9 September 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.012

zbMATH Keywords

maximum flowfeature selectioninstance selectioninstance space analysisvalidation of OR computations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Statistical measures of two dimensional point set uniformity
• Computational investigations of maximum flow algorithms
• On implementing the push-relabel method for the maximum flow problem
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• Instance spaces for machine learning classification
• Measuring instance difficulty for combinatorial optimization problems
• Testing heuristics: We have it all wrong
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
• Generation techniques for linear programming instances with controllable properties
• A new?old algorithm for minimum-cut and maximum-flow in closure graphs
• Maximal Flow Through a Network
• Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• A Faster Deterministic Maximum Flow Algorithm
• ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS
• A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
• Simplifications and speedups of the pseudoflow algorithm
• Max flows in O(nm) time, or better
• Use of Representative Operation Counts in Computational Testing of Algorithms

This page was built for publication: Enhanced instance space analysis for the maximum flow problem