A branch and bound algorithm for the acyclic subgraph problem

DOI10.1016/0377-2217(81)90005-9MaRDI QIDQ1154950zbMATH OpenOpenAlexFDO

Authors Rob Kaas

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

zbMATH Keywords

heuristic algorithmbranch and bound algorithmlexicographic enumerationfeedback arc set problemacyclic subgraph problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3476924 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3202920 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• A Consistent Extension of Condorcet’s Election Principle
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• Maximum likelihood paired comparison ranking by linear programming
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems

Cited in

(14)

• The linear ordering problem: instances, search space analysis and algorithms
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Models for concurrent product and process design
• Workload balancing and loop layout in the design of a flexible manufacturing system
• Bayesian network learning via topological order
• A new heuristic algorithm solving the linear ordering problem
• Semidefinite relaxations of ordering problems
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• An exact method for the minimum feedback arc set problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The linear ordering problem revisited
• Approximations for the maximum acyclic subgraph problem
• On the acyclic subgraph polytope
• Median linear orders: Heuristics and a branch and bound algorithm

This page was built for publication: A branch and bound algorithm for the acyclic subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154950)