Search Results - subject:"combinatorial"

A New Payment Rule for Core-Selecting Package Auctions

Erdil, Aytek; Klemperer, Paul - Economics Group, Nuffield College, University of Oxford - 2009

We propose a new, easy-to-implement, class of payment rules, “Reference Rules,” to make core-selecting package auctions more robust. Small, almost riskless, profitable deviations from “truthful bidding” are often easy for bidders to find under currently-used payment rules. Reference...

Persistent link: https://www.econbiz.de/10008469670

An Analysis of Design Problems in Combinatorial Procurement Auctions

Bichler, Martin; Pikovsky, Alexander; Setzer, Thomas - In: Business & Information Systems Engineering 1 (2009) 1, pp. 111-117

procurement. Combinatorial auctions, for example, enable suppliers to submit bids on bundles of items. A number of laboratory … suppliers. </ItemContent> <ItemContent> Iterative combinatorial auctions have a number of advantages in practical applications … will discuss fundamental problems in the design of combinatorial auctions and the particularities of procurement …

Persistent link: https://www.econbiz.de/10011001386

On some applications of the selective graph coloring problem

Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, … - In: European Journal of Operational Research 240 (2015) 2, pp. 307-314

In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the...

Persistent link: https://www.econbiz.de/10011097811

Combinatorial Auctions for Player Selection in the Indian Premier League (IPL)

Chakraborty, Soumyakanti; Sen, Anup K.; Bagchi, Amitava - In: Journal of Sports Economics 16 (2015) 1, pp. 86-107

valuations. We recommend a combinatorial auction scheme MRPF which enables bidders to exploit the complementary nature of the …

Persistent link: https://www.econbiz.de/10011106400

Sustainable supply chain network design: An optimization-oriented review

Eskandarpour, Majid; Dejax, Pierre; Miemczyk, Joe; … - In: Omega 54 (2015) C, pp. 11-32

Supply chain network design (SCND) models and methods have been the subject of several recent literature review surveys, but none of them explicitly includes sustainable development as a main characteristic of the problem considered. The aim of this review is to bridge this gap. The paper...

Persistent link: https://www.econbiz.de/10011264268

A semidefinite optimization-based approach for global optimization of multi-row facility layout

Hungerländer, Philipp; Anjos, Miguel F. - In: European Journal of Operational Research 245 (2015) 1, pp. 46-61

, and thus makes it possible to exploit the underlying combinatorial structure. In particular we can explicitly control the …

Persistent link: https://www.econbiz.de/10011264291

A branch-price-and-cut algorithm for the minimum evolution problem

Catanzaro, Daniele; Aringhieri, Roberto; Di Summa, Marco; … - In: European Journal of Operational Research 244 (2015) 3, pp. 753-765

We investigate the Minimum Evolution Problem (MEP), an NP-hard network design problem arising from computational biology. The MEP consists in finding a weighted unrooted binary tree having n leaves, minimal length, and such that the sum of the edge weights belonging to the unique path between...

Persistent link: https://www.econbiz.de/10011264300

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem

Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine - In: European Journal of Operational Research 244 (2015) 3, pp. 766-777

In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NP-hard combinatorial …

Persistent link: https://www.econbiz.de/10011264319

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem

Chassein, André B.; Goerigk, Marc - In: European Journal of Operational Research 244 (2015) 3, pp. 739-747

Minmax regret optimization aims at finding robust solutions that perform best in the worst-case, compared to the respective optimum objective value in each scenario. Even for simple uncertainty sets like boxes, most polynomially solvable optimization problems have strongly NP-complete minmax...

Persistent link: https://www.econbiz.de/10011264336

Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach

Zhang, Panpan; Chen, Chen; Mahmoud, Hosam - In: Statistics & Probability Letters 96 (2015) C, pp. 149-153

Two-color triangular urn models have been investigated recently. Moments of ball counts of a particular color have been obtained exactly and asymptotically in a number of sources (Janson, 2006, Kuba and Panholzer, 2014, and Flajolet et al., 2006). Exact factorial moments are in Kuba and...

Persistent link: https://www.econbiz.de/10011115967