Pages that link to "Item:Q5945202"
From MaRDI portal
The following pages link to Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202):
Displaying 16 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)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Linear programming based time lag identification in event sequences (Q1716564) (← links)
- Modeling and heuristics for production time crashing in supply chain network design (Q2173131) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← 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)
- Optimal dynamic quantizers for discrete-valued input control (Q2440610) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
