Pages that link to "Item:Q2899091"

The following pages link to Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems (Q2899091):

Displayed 13 items.

• A matheuristic approach for the pollution-routing problem (Q319140) ‎ (← links)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) ‎ (← links)
• An exact cooperative method for the uncapacitated facility location problem (Q495932) ‎ (← links)
• Scheduling of maintenance work of a large-scale tramway network (Q724038) ‎ (← links)
• A set partitioning heuristic for the home health care routing and scheduling problem (Q1711476) ‎ (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) ‎ (← links)
• A time-based pheromone approach for the ant system (Q1758053) ‎ (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) ‎ (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) ‎ (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) ‎ (← links)
• Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) ‎ (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) ‎ (← links)
• Managing hospital inpatient beds under clustered overflow configuration (Q2676413) ‎ (← links)