Enhanced instance space analysis for the maximum flow problem

DOI10.1016/J.EJOR.2022.04.012MaRDI QIDQ2171589zbMATH OpenOpenAlexWikidataFDO

Authors 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

feature selectioninstance selectioninstance space analysismaximum flowvalidation of OR computations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• scientific article; zbMATH DE number 1022488
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• Instance space analysis for a personnel scheduling problem

Cites work

• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• A Faster Deterministic Maximum Flow Algorithm
• A new approach to the maximum-flow problem
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
• Computational investigations of maximum flow algorithms
• Faster and more dynamic maximum flow by incremental breadth-first search
• Generating new test instances by evolving in instance space
• Generation techniques for linear programming instances with controllable properties
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• scientific article; zbMATH DE number 3069634 (Why is no real title available?)
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Instance spaces for machine learning classification
• Max flows in O(nm) time, or better
• Maximal Flow Through a Network
• Measuring instance difficulty for combinatorial optimization problems
• Network flows. Theory, algorithms, and applications.
• On implementing the push-relabel method for the maximum flow problem
• ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• Simplifications and speedups of the pseudoflow algorithm
• Statistical measures of two dimensional point set uniformity
• Testing heuristics: We have it all wrong
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• Towards objective measures of algorithm performance across instance space
• Use of Representative Operation Counts in Computational Testing of Algorithms

Cited in

(7)

• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
• On the impact of initialisation strategies on maximum flow algorithm performance
• Instance space analysis for 2D bin packing mathematical models
• Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
• Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
• Machine scheduling instance generation by reverse engineering from instance space analysis
• Obtaining k-degree anonymous networks via mathematical programming

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

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