Pages that link to "Item:Q2641083"

The following pages link to Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083):

Displaying 50 items.

• Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
• Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
• Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← 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)
• Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
• A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
• Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
• Hybridization of GRASP metaheuristic with data mining techniques (Q2506213) (← links)
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791) (← links)
• Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• Time—Frequency Analysis of Brain Neurodynamics (Q3565462) (← links)
• Unified global optimality conditions for smooth minimization problems with mixed variables (Q3598042) (← links)
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
• Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
• Testing optimality for quadratic 0?1 unconstrained problems (Q4859451) (← links)
• Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• The Random QUBO (Q5050147) (← links)
• A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
• Solving the Production and Maintenance Optimization Problem by a Global Approach (Q5357763) (← links)
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)