A branch and bound algorithm for the acyclic subgraph problem
From MaRDI portal
Publication:1154950
DOI10.1016/0377-2217(81)90005-9zbMath0465.90090OpenAlexW1998141884MaRDI QIDQ1154950
Publication date: 1981
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(81)90005-9
heuristic algorithmbranch and bound algorithmlexicographic enumerationfeedback arc set problemacyclic subgraph problem
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Directed graphs (digraphs), tournaments (05C20)
Related Items
On the acyclic subgraph polytope, Approximations for the maximum acyclic subgraph problem, The linear ordering problem revisited, A survey on the linear ordering problem for weighted or unweighted tournaments, Semidefinite relaxations of ordering problems, An Exact Method for the Minimum Feedback Arc Set Problem, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The linear ordering problem: instances, search space analysis and algorithms, Median linear orders: Heuristics and a branch and bound algorithm, A new heuristic algorithm solving the linear ordering problem, Models for concurrent product and process design, Workload balancing and loop layout in the design of a flexible manufacturing system, Unnamed Item
Cites Work
- A Consistent Extension of Condorcet’s Election Principle
- Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
- Maximum likelihood paired comparison ranking by linear programming
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
