Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
DOI10.1002/NET.3230200102zbMATH Open0691.90088OpenAlexW2095283119MaRDI QIDQ3033586FDOQ3033586
Authors: Merrill 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
Recommendations
heuristicskew-symmetric matrixbranch-and-boundquadratic assignmentpermutation matrixskew matrixprincipal diagonalscreening algorithmweighted feedback arc set problem
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Integer programming (90C10)
Cites Work
Cited In (7)
- Tight localizations of feedback sets
- An efficient algorithm for minimum feedback vertex sets in rotator graphs
- Combinatorial algorithms for feedback problems in directed graphs
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Approximations for the maximum acyclic subgraph problem
This page was built for publication: Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033586)
