Global optimization method for solving the minimum maximal flow problem

DOI10.1080/1055678031000120191zbMath1106.90069OpenAlexW2045438354MaRDI QIDQ4664042

Nguyen Van Thoai, Jun-Ya Gotoh, Yoshitsugu Yamamoto

Publication date: 5 April 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678031000120191

zbMATH Keywords

Global OptimizationAdjacent Vertex SearchBranch And BoundMinimum Maximal FlowOptimization Over Efficient Sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (5)

Optimization of a linear function over an integer efficient set ⋮ On DC optimization algorithms for solving minmax flow problems ⋮ On optimization over the efficient set in linear multicriteria programming ⋮ Global optimization method for solving mathematical programs with linear complementarity constraints ⋮ Small maximal matchings of random cubic graphs

This page was built for publication: Global optimization method for solving the minimum maximal flow problem