Pages that link to "Item:Q2783926"
From MaRDI portal
The following pages link to Adaptive Memory Tabu Search for Binary Quadratic Programs (Q2783926):
Displaying 50 items.
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← 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)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← 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)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← 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)
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- Strategic oscillation for the quadratic multiple knapsack problem (Q2450910) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- QUBO Software (Q5050151) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
- Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis (Q5451111) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
