Computational aspects of a branch and bound algorithm for quadratic zero- one programming
From MaRDI portal
Publication:2641083
Recommendations
Cites work
- A Survey of Methods for Pure Nonlinear Integer Programming
- A branch and bound algorithm for the maximum clique problem
- A solvable case of quadratic 0-1 programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An improved enumerative algorithm for solving quadratic zero-one programming
- Experiments in quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems
- Quadratic knapsack problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
Cited in
(only showing first 100 items - show all)- Building an iterative heuristic solver for a quantum annealer
- On characterization of maximal independent sets via quadratic optimization
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Optimality conditions for the minimization of quadratic \(0-1\) problems
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- An effective modeling and solution approach for the generalized independent set problem
- Bivalent quadratic programming problem - A computational study
- An evolutionary heuristic for quadratic 0-1 programming
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Linear and quadratic programming approaches for the general graph partitioning problem
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Comparison of column generation models for channel assignment in cellular networks
- scientific article; zbMATH DE number 4116303 (Why is no real title available?)
- Testing optimality for quadratic 0?1 unconstrained problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- An improved linearization strategy for zero-one quadratic programming problems
- A Decomposition Method for Quadratic Zero-One Programming
- Hybridization of GRASP metaheuristic with data mining techniques
- The maximum clique problem
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- Mathematical programming models and exact algorithms
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A column generation approach for the unconstrained binary quadratic programming problem
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Optimization methods for mixed integer weakly concave programming problems
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Modelling competitive Hopfield networks for the maximum clique problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The random QUBO
- The unconstrained binary quadratic programming problem: a survey
- Solving the max-cut problem using eigenvalues
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Unconstrained quadratic bivalent programming problem
- Box-constrained quadratic programs with fixed charge variables
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- CON due-date determination and sequencing
- A new effective branch-and-bound algorithm to the high order MIMO detection problem
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A neurodynamic approach to zero-one quadratic programming
- A tight lower bound for a special case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- Best ellipsoidal relaxation to solve a nonconvex problem.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Two-stage quadratic integer programs with stochastic right-hand sides
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
- Minimization of a quadratic pseudo-Boolean function
- Global optimality conditions for quadratic \(0-1\) optimization problems
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A quadratic assignment formulation of the molecular conformation problem
- A continuous approch for globally solving linearly constrained quadratic
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Periodic complementary binary sequences and combinatorial optimization algorithms
- A branch and bound algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- Unified global optimality conditions for smooth minimization problems with mixed variables
- Solving the production and maintenance optimization problem by a global approach
- Node and edge relaxations of the max-cut problem
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- A hybrid metaheuristic approach to solving the UBQP problem
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Path relinking for unconstrained binary quadratic programming
- The equitable dispersion problem
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Lower bound improvement and forcing rule for quadratic binary programming
- New formulations of the multiple sequence alignment problem
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- Graph separation techniques for quadratic zero-one programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Detecting embedded Horn structure in propositional logic
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A new branch and bound method with pretreatment for the binary quadratic programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- A trust branching path heuristic for zero-one programming
- Computational aspects of the maximum diversity problem
This page was built for publication: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641083)
