Pages that link to "Item:Q1278258"

The following pages link to Relaxation heuristics for a generalized assignment problem (Q1278258):

Displaying 19 items.

• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• Elitist genetic algorithm for assignment problem with imprecise goal (Q856264) (← links)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
• Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
• Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
• A genetic algorithm for the project assignment problem (Q2485176) (← links)
• An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
• Optimal ABC inventory classification using interval programming (Q2792928) (← links)
• Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)