Pages that link to "Item:Q1319011"
From MaRDI portal
The following pages link to A quadratic assignment formulation of the molecular conformation problem (Q1319011):
Displaying 20 items.
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
- A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- (Q5203914) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
