Pages that link to "Item:Q954050"

The following pages link to Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050):

Displaying 8 items.

• Cross entropy for multiobjective combinatorial optimization problems with linear relaxations (Q319096) (← links)
• Minimising maximum response time (Q336510) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
• Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
• A cross entropy approach to design of reliable networks (Q1042175) (← links)
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)