Sciweavers

68 search results - page 11 / 14
» Integer Programming for Combinatorial Auction Winner Determi...
Sort
View
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
14 years 9 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter

Publication
518views
16 years 8 months ago
Procurement of Global Logistics Services Using Combinatorial Auction
Global logistics flows have increased dramatically in recent years due to the globalization in the world economy. It is more complex than the domestic logistics, consisting of mult...
Nikesh Kumar Srivastava, N. Viswanadham, and S. Ka...
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CPAIOR
2007
Springer
15 years 3 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
IAT
2003
IEEE
15 years 2 months ago
Agent-based decision support for actual-world procurement scenarios
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
Juan A. Rodríguez-Aguilar, Andrea Giovannuc...