The following pages link to Heuristics for a bidding problem (Q2489281):
Displayed 8 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- A hybrid ant colony algorithm for the winner determination problem (Q2130382) (← links)
- The cross-entropy method for the winner determination problem in combinatorial auctions (Q2209236) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction (Q2866140) (← links)
- A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions (Q2883609) (← links)