Pages that link to "Item:Q1683688"

The following pages link to The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688):

Displaying 9 items.

• A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• The bipartite Boolean quadric polytope (Q2673249) (← links)
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)