Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem

DOI10.1002/net.3230200102zbMath0691.90088MaRDI QIDQ3033586

M. Flood

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200102

zbMATH Keywords

branch-and-bound; quadratic assignment; permutation matrix; heuristic; skew-symmetric matrix; skew matrix; principal diagonal; screening algorithm; weighted feedback arc set problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C20: Quadratic programming

90B10: Deterministic network models in operations research

Related Items

Approximations for the maximum acyclic subgraph problem