Pages that link to "Item:Q3487135"

The following pages link to Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (Q3487135):

Displaying 15 items.

• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company (Q2519112) (← links)
• OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
• Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
• A heuristic algorithm for the set covering problem (Q4645914) (← links)
• Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
• A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
• A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)