Pages that link to "Item:Q2641083"
From MaRDI portal
The following pages link to Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083):
Displaying 50 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Periodic complementary binary sequences and combinatorial optimization algorithms (Q604877) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- CON due-date determination and sequencing (Q908841) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- The maximum clique problem (Q1318271) (← links)
- A quadratic assignment formulation of the molecular conformation problem (Q1319011) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Computational aspects of the maximum diversity problem (Q1360111) (← links)
- A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models (Q1378871) (← links)
- Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
