Pages that link to "Item:Q1154950"

The following pages link to A branch and bound algorithm for the acyclic subgraph problem (Q1154950):

Displaying 11 items.

• Semidefinite relaxations of ordering problems (Q359627) (← links)
• Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Models for concurrent product and process design (Q1046061) (← links)
• Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
• The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
• A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
• Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
• The linear ordering problem revisited (Q2629715) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)