Pages that link to "Item:Q4699174"

The following pages link to Graph Partitioning and Continuous Quadratic Programming (Q4699174):

Displaying 19 items.

• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• A practical method for solving large-scale TRS (Q537634) (← links)
• Error bounds of Lanczos approach for trust-region subproblem (Q722456) (← links)
• Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
• An exact algorithm for graph partitioning (Q1942271) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
• Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Discrete Optimization with Decision Diagrams (Q2806864) (← links)
• Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
• A Nested Lanczos Method for the Trust-Region Subproblem (Q3174764) (← links)
• Global convergence of SSM for minimizing a quadratic over a sphere (Q4671844) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• On the Generalized Lanczos Trust-Region Method (Q5363378) (← links)
• Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
• The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem (Q5857292) (← links)
• On convergence of the generalized Lanczos trust-region method for trust-region subproblems (Q6667676) (← links)