Filters








5,109 Hits in 4.8 sec

Page 1494 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
In this paper, we concentrate on sequential branch-and-cut for hard combinatorial optimization problems, while branch-and-cut for general mixed integer linear programming is treated in [A.  ...  Summary: “Bundle methods have been used frequently to solve nonsmooth optimization problems.  ... 

Solving the combinatorial double auction problem

Mu Xia, Jan Stallaert, Andrew B. Whinston
2005 European Journal of Operational Research  
We also found empirically that the performance of this branch-and-bound method is superior to the specialized search methods that have been proposed for this class of problems.  ...  When the goods are indivisible, solving the winner determination problem (WDP) is an Integer Programming problem and NP-hard in its general form.  ...  We also would like to thank Alkis Vazacopoulos at Dash Optimization for providing the XPRESS solver software and helpful comments.  ... 
doi:10.1016/j.ejor.2003.11.018 fatcat:pvnyi3jgdvgi7gez2d5eykqbra

Solving Winner Determination Problem in Double Combinatorial Auction by ICA in Cloud Computing

Rezvan AlipoorSabzevari, Ebrahim Behrouzian Nejad
2015 International Journal of Computer Applications  
The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method.  ...  The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases.  ...  Bid Bundles ICA ICA is one of the approaches of evolutionary computing that try to find optimal answers of different optimization problems ,this approach provides an algorithm for solving mathematical  ... 
doi:10.5120/19366-1003 fatcat:yligzqvytza7potawgrm64noky

A new method of winner determination for economic resource allocation in cloud computing systems

2016 Journal of Advances in Technology and Engineering Research  
The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation.  ...  One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method.  ...  Many of these resource allocation problems are NP-Hard problems. A large number of management tools of new data centersoperate through proper heuristical methods to solve independent problems.  ... 
doi:10.20474/-jater2.1.3 fatcat:qt34zx4xjbcbziheu64hu2qubq

Page 672 of Mathematical Reviews Vol. , Issue 2001A [page]

2001 Mathematical Reviews  
We also give a bundle method for minimizing fy.  ...  (PL-PAN-S; Warsaw) A projection-proximal bundle method for convex nondifferentiable minimization.  ... 

Combinatorial Bid Generation Problem for Transportation Service Procurement

Xiubin Wang, Mu Xia
2005 Transportation Research Record  
First, the bidder's optimality criterion of a combinatorial bid is clarified, and then the focus is on the bundling method when an OR bid language is used.  ...  In combinatorial auctions, solving the bid generation problem (BGP) for bidders is critical to achieving efficiency.  ...  ACKNOWLEDGMENTS The first author is grateful to Jiongjiong Song for sending his papers in press. Both authors express their appreciation to Dash Optimizations for generous software support.  ... 
doi:10.3141/1923-20 fatcat:jgbiadzg75durmos4l26zvcpxi

Combinatorial Bid Generation Problem for Transportation Service Procurement

Xiubin Wang, Mu Xia
2005 Transportation Research Record  
First, the bidder's optimality criterion of a combinatorial bid is clarified, and then the focus is on the bundling method when an OR bid language is used.  ...  In combinatorial auctions, solving the bid generation problem (BGP) for bidders is critical to achieving efficiency.  ...  ACKNOWLEDGMENTS The first author is grateful to Jiongjiong Song for sending his papers in press. Both authors express their appreciation to Dash Optimizations for generous software support.  ... 
doi:10.1177/0361198105192300120 fatcat:4zbnb6zhdjac5edq5nj3k3ykky

A heuristic approach for the allocation of resources in large-scale computing infrastructures

Kevin Lee, Georg Buss, Daniel Veit
2015 Concurrency and Computation  
For many cases of NP-hard problems it may be possible to have algorithms that produce reasonably fast close to optimal solutions [17, 18] .  ...  This paper focuses on the application of heuristic optimization methods for the efficient sharing of resources using market mechanisms.  ...  Solving the Multi-Attribute Combinatorial Exchange winner determination problem (MWDP) to optimality is shown to be an NP-hard problem by [29] .  ... 
doi:10.1002/cpe.3709 fatcat:43eu4divpbf4jb4d3ianembp7q

Computing core payments in combinatorial auctions

Robert W. Day, S. Raghavan
2007 ACM SIGecom Exchanges  
Much of the literature on combinatorial auctions has focused on the underlying problem of finding an efficient allocation (called the winner-determination problem) which is usually N P-hard, and the problem  ...  A combinatorial auction is one in which preferences are expressed for combinations or bundles of items, rather than just for individual items.  ...  These drawbacks are well-documented in the literature, but there is currently no consensus as to the best method for setting prices for a given set of bids in a combinatorial auction.  ... 
doi:10.1145/1345037.1345042 fatcat:rpgfyvf7dfelhj46qxrvkrxf4a

Generalized Knapsack Solvers for Multi-unit Combinatorial Auctions: Analysis and Application to Computational Resource Allocation [chapter]

Terence Kelly
2006 Lecture Notes in Computer Science  
The optimal allocation problem is a generalized multi-dimensional knapsack problem (MDKP): allocating a bundle of goods to an agent reduces the pool of available goods, just as placing an item in a container  ...  The problem of allocating discrete computational resources motivates interest in general multi-unit combinatorial exchanges.  ...  Given an integert and a resource pool size n, we define Ft as the bundle assigned to agentt by the optimal assignment for the sub-instance defined byt and n.  ... 
doi:10.1007/11575726_6 fatcat:jbzx6zbrgrfibaegngzqgdkiae

Allocation of advertising space by a web service provider using combinatorial auctions

Sandeep Dulluri, N. R. Srinivasa Raghavan
2005 Sadhana (Bangalore)  
We resort to "ant" systems (ant -social insect/intelligent agent) to solve the above N P-hard combinatorial optimization problem which involves winner-determination in multi-item and multi-unit combinatorial  ...  We observe that combinatorial auctions serve as effective mechanisms for allocating advertising slots over the internet.  ...  Y Narahari for motivating us to take up the current work. The first author would like to thank Mr Prasanna Shrinivas for inputs.  ... 
doi:10.1007/bf02706245 fatcat:acfa4l5f4bezhnm4qk4ghe5iii

Coordination of Purchasing and Bidding Activities Across Markets

Daniel D. Zeng, James C. Cox, Moshe Dror
2004 Social Science Research Network  
We observe that making optimal purchasing decisions in this context is N P-hard in the strong sense and suggest several efficient computational methods based on discrete location theory.  ...  We study the underlying coordination problem for a collection of firstor second-price sealed-bid auctions and derive the optimal coordination and bidding policies.  ...  The N Phardness proof for UFL is based on polynomial reduction from the vertex cover problem, a well-known N P-hard problem ( [23] , Theorem 3.1).  ... 
doi:10.2139/ssrn.895511 fatcat:3mm3dzok2jcjddaazojmzzjbsy

Coordination of purchasing and bidding activities across markets

D.D. Zeng, J.C. Cox, M. Dror
2004 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the  
We observe that making optimal purchasing decisions in this context is N P-hard in the strong sense and suggest several efficient computational methods based on discrete location theory.  ...  We study the underlying coordination problem for a collection of firstor second-price sealed-bid auctions and derive the optimal coordination and bidding policies.  ...  The N Phardness proof for UFL is based on polynomial reduction from the vertex cover problem, a well-known N P-hard problem ( [23] , Theorem 3.1).  ... 
doi:10.1109/hicss.2004.1265405 dblp:conf/hicss/ZengCD04 fatcat:pijwcjqp2bbkjm7ettkhhbhw2a

Efficient algorithms for combinatorial auctions with volume discounts arising in web service composition

B. Prashanth, Y. Narahari
2008 2008 IEEE International Conference on Automation Science and Engineering  
An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process.  ...  In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts.  ...  To find the optimal solution in Φ we just need to have minimum price at k for all bundles and solve it.  ... 
doi:10.1109/coase.2008.4626528 dblp:conf/case/BandaruN08 fatcat:z3iqneitvba3ffrchd5zrfgfo4

Price-Setting Combinatorial Auctions for Coordination and Control of Manufacturing Multiagent Systems: Updating Prices Methods [chapter]

Juan José Lavios Villahoz, Ricardo del Olmo Martínez, Alberto Arauzo Arauzo
2010 IFIP Advances in Information and Communication Technology  
In this work we review some updating price mechanisms for combinatorial auctions based on the Lagrangian Relaxation Method.  ...  We focus our research to solve the optimization scheduling problem in the shop floor, taking into account the objectives of resource allocation in dynamic environments, i.e.  ...  Lagrangian relaxation technique relaxes the complex constraints of an optimization problem (i.e. those constraints which make the problem hard to solve), making the problem easier to optimize.  ... 
doi:10.1007/978-3-642-14341-0_34 fatcat:hjfv4ep7d5gyrgeuv23imtdnmy
« Previous Showing results 1 — 15 out of 5,109 results