The constrained minimax linear assignment problem

DOI10.1080/10556780008805792zbMath0988.90027OpenAlexW2028071418MaRDI QIDQ4521378

Peerayuth Charnsethikul

Publication date: 22 July 2002

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

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

zbMATH Keywords

combinatorial optimizationpolynomial time algorithmbranch and bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

On weighting two criteria with a parameter in combinatorial optimization problems

This page was built for publication: The constrained minimax linear assignment problem