Pages that link to "Item:Q5313022"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313022):
Displaying 14 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract) (Q2816031) (← links)
- Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
- A Geometric Approach to Betweenness (Q4210221) (← links)
- (Q4537753) (← links)
