The following pages link to (Q4321552):
Displayed 10 items.
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Integer Linear Programming in Computational Biology (Q3644723) (← links)