Pages that link to "Item:Q4405937"
From MaRDI portal
The following pages link to Randomized heuristics for the Max-Cut problem (Q4405937):
Displaying 50 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Solving the maxcut problem by the global equilibrium search (Q466339) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Heuristic and exact methods for the cutting sequencing problem (Q1303545) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- A gradient-based randomised heuristic for the maximum cut problem (Q1758877) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
- Bistable latch Ising machines (Q2152093) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- Two level minimization in multidimensional scaling (Q2465484) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Scatter search --- wellsprings and challenges (Q2570140) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- Discrete optimization with decision diagrams (Q2806864) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) (← links)
- Local Search Based on Genetic Algorithms (Q3509426) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
- Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5901727) (← links)
- Solving combinatorial optimisation problems using oscillator based Ising machines (Q6095496) (← links)
