Pages that link to "Item:Q1420614"
From MaRDI portal
The following pages link to Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614):
Displaying 9 items.
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Dominance guarantees for above-average solutions (Q937396) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)