The following pages link to (Q3048590):
Displaying 49 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- The impact of distance on location problems (Q1142684) (← links)
- Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
- A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique (Q2467428) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
- (Q5203914) (← links)
- (Q5869388) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
