Pages that link to "Item:Q702730"
From MaRDI portal
The following pages link to Multistart tabu search strategies for the unconstrained binary quadratic optimization problem (Q702730):
Displaying 39 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Constructing uniform designs: A heuristic integer programming method (Q413474) (← links)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (Q537995) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- Mapping a logical representation of TSP to quantum annealing (Q2099624) (← links)
- Model-based approaches to multi-attribute diverse matching (Q2170223) (← links)
- Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem (Q2627686) (← links)
- Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
- Garden optimization problems for benchmarking quantum annealers (Q2685606) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Adaptive memory tabu search for binary quadratic programs (Q2783926) (← links)
- Multi-start approach for an integer determinant maximization problem (Q4916310) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
- QUBO Software (Q5050151) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- Expansion-based hill-climbing (Q6074953) (← links)
- Partial neighborhood local searches (Q6082175) (← links)
- Battleship, tomography and quantum annealing (Q6622961) (← links)
