Pages that link to "Item:Q4291502"

The following pages link to Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic (Q4291502):

Displayed 14 items.

• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) ‎ (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) ‎ (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) ‎ (← links)
• General purpose heuristics for integer programming. I (Q1365114) ‎ (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) ‎ (← links)
• Solving zero-one mixed integer programming problems using tabu search (Q1609922) ‎ (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) ‎ (← links)
• Hybrid extreme point tabu search (Q1609924) ‎ (← links)
• Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) ‎ (← links)
• Scatter search and star-paths: Beyond the genetic metaphor (Q1908997) ‎ (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) ‎ (← links)
• Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) ‎ (← links)
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) ‎ (← links)
• Matheuristics: survey and synthesis (Q6056873) ‎ (← links)