Computational aspects of a branch and bound algorithm for quadratic zero- one programming
From MaRDI portal
Publication:2641083
DOI10.1007/BF02247879zbMath0721.65034OpenAlexW1501516191MaRDI QIDQ2641083
Panos M. Pardalos, Gregory P. Rodgers
Publication date: 1990
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02247879
Related Items
Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Comparison of column generation models for channel assignment in cellular networks, On characterization of maximal independent sets via quadratic optimization, BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, A successive linear approximation algorithm for the global minimization of a concave quadratic program, Minimization of a quadratic pseudo-Boolean function, Mathematical Programming Models and Exact Algorithms, The Random QUBO, Building an iterative heuristic solver for a quantum annealer, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Graph separation techniques for quadratic zero-one programming, Solving the max-cut problem using eigenvalues, Computational aspects of the maximum diversity problem, SDP diagonalizations and perspective cuts for a class of nonseparable MIQP, Probabilistic GRASP-tabu search algorithms for the UBQP problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods, A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, An algorithm for finding a maximum weighted independent set in an arbitrary graph, Periodic complementary binary sequences and combinatorial optimization algorithms, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming, Diversification-driven tabu search for unconstrained binary quadratic problems, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, Lagrangian solution of maximum dispersion problems, A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds, Optimality Conditions for the Minimization of Quadratic 0-1 Problems, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems, A hybrid metaheuristic approach to solving the UBQP problem, The unconstrained binary quadratic programming problem: a survey, Cardinality constrained portfolio selection problem: a completely positive programming approach, Solving the Production and Maintenance Optimization Problem by a Global Approach, Testing optimality for quadratic 0?1 unconstrained problems, New formulations of the multiple sequence alignment problem, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, Two-stage quadratic integer programs with stochastic right-hand sides, Penalty parameter for linearly constrained 0--1 quadratic programming, CON due-date determination and sequencing, A column generation approach for the unconstrained binary quadratic programming problem, Improved semidefinite bounding procedure for solving max-cut problems to optimality, Bounds for Random Binary Quadratic Programs, Best ellipsoidal relaxation to solve a nonconvex problem., Linear and quadratic programming approaches for the general graph partitioning problem, An exact algorithm for the maximum clique problem, Global optimality conditions and optimization methods for quadratic integer programming problems, Global minimization of difference of quadratic and convex functions over box or binary constraints, Box-constrained quadratic programs with fixed charge variables, An improved linearization strategy for zero-one quadratic programming problems, An effective modeling and solution approach for the generalized independent set problem, Optimization methods for mixed integer weakly concave programming problems, A neurodynamic approach to zero-one quadratic programming, A polynomial case of convex integer quadratic programming problems with box integer constraints, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Time—Frequency Analysis of Brain Neurodynamics, Complexity of uniqueness and local search in quadratic 0-1 programming, Detecting embedded Horn structure in propositional logic, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Quadratic convex reformulation for quadratic programming with linear on-off constraints, Path relinking for unconstrained binary quadratic programming, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, A branch and bound algorithm for the maximum clique problem, A continuous approch for globally solving linearly constrained quadratic, A new linearization technique for multi-quadratic 0-1 programming problems., Perspective cuts for a class of convex 0-1 mixed integer programs, A new effective branch-and-bound algorithm to the high order MIMO detection problem, A tight lower bound for a special case of quadratic 0-1 programming, Global optimality conditions for quadratic \(0-1\) optimization problems, Convex reformulation for binary quadratic programming problems via average objective value maximization, Unified global optimality conditions for smooth minimization problems with mixed variables, A filled function method for quadratic programs with binary constraints†, Lower bound improvement and forcing rule for quadratic binary programming, Hybridization of GRASP metaheuristic with data mining techniques, Semidefinite relaxations for partitioning, assignment and ordering problems, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Semidefinite relaxations for partitioning, assignment and ordering problems, Simple and fast surrogate constraint heuristics for the maximum independent set problem, The equitable dispersion problem, A trust branching path heuristic for zero-one programming, An evolutionary heuristic for quadratic 0-1 programming, Lagrangean decompositions for the unconstrained binary quadratic programming problem, Linear programming for the \(0-1\) quadratic knapsack problem, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, One-pass heuristics for large-scale unconstrained binary quadratic problems, Erratum to ``Comparison of column generation models for channel assignment in cellular networks, The maximum clique problem, A quadratic assignment formulation of the molecular conformation problem, Node and edge relaxations of the max-cut problem, Modelling competitive Hopfield networks for the maximum clique problem, An unconstrained quadratic binary programming approach to the vertex coloring problem
Cites Work
- The indefinite zero-one quadratic problem
- An improved enumerative algorithm for solving quadratic zero-one programming
- Unconstrained quadratic bivalent programming problem
- A solvable case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Methods of Nonlinear 0-1 Programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- A Survey of Methods for Pure Nonlinear Integer Programming
- Quadratic knapsack problems
- Minimum cuts and related problems
- A branch and bound algorithm for the maximum clique problem
