Pages that link to "Item:Q2355744"

The following pages link to The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744):

Displaying 17 items.

• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
• Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (Q2060395) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
• The bipartite Boolean quadric polytope (Q2673249) (← links)
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)