Pages that link to "Item:Q1610376"

The following pages link to Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand (Q1610376):

Displayed 8 items.

• A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) ‎ (← links)
• Design for optimized multi-lateral multi-commodity markets (Q706897) ‎ (← links)
• Used car salesman problem: a differential auction-barter market (Q812388) ‎ (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) ‎ (← links)
• A double auction based mathematical market model and heuristics for Internet-based secondhand durable good markets (Q2273661) ‎ (← links)
• Combinatorial auctions (Q2480257) ‎ (← links)
• Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) ‎ (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) ‎ (← links)