Pages that link to "Item:Q2899047"
From MaRDI portal
The following pages link to Exact Algorithms for the Quadratic Linear Ordering Problem (Q2899047):
Displaying 16 items.
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)
