The following pages link to GRASP for set packing problems. (Q1420382):
Displaying 19 items.
- A hybrid evolutionary approach for set packing problem (Q260677) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Stability evaluation of a railway timetable at station level (Q2378419) (← links)
- A multi-objective model for environmental investment decision making (Q2384603) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times (Q2467265) (← links)
- Hybridization of GRASP metaheuristic with data mining techniques (Q2506213) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- Applications of the DM‐GRASP heuristic: a survey (Q3546241) (← links)
