Pages that link to "Item:Q1072937"
From MaRDI portal
The following pages link to On lower bounds for a class of quadratic 0,1 programs (Q1072937):
Displaying 12 items.
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Some applications of nonnegative linear systems: Farkas strikes again (Q1342285) (← links)
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem (Q1389197) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
