Pages that link to "Item:Q817187"

The following pages link to An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187):

Displaying 18 items.

• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
• An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
• An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5919301) (← links)
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs (Q5963623) (← links)
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation (Q6047870) (← links)